It was my fault, misread the exercise lol.
Anyway, it consists on an algorithm for the square root. Here goes the code if anyone is interested:
Code:
#include <iostream>
using namespace std;
int main()
{
double delta, nMaxIter;
int n;
cout<<"delta: ";
cin>>delta;
cout<<"nMaxIter: ";
cin>>nMaxIter;
cout<<"Numero: ";
cin>>n;
double rqn, rqnii, dif;
double rq = 1;
for (int i = 1; i <= nMaxIter; i++)
{
rqn = ((rq + (n / rq)) /2);
rqnii = pow(rqn,2);
dif = n - rqnii;
rq = rqn;
if (abs(dif) <= delta || i == nMaxIter)
{
cout<<"rq = " <<rq <<endl;
break;
}
}
}