Write a function called sroot that takes two numeric values. The first is the number to find the square root of and the second will be the precision. Use the successive approximation algorithm given to return the approximate square root.

#include

#include

using namespace std;

//overload sroot() for integer, longs, and doubles.

int sroot (int i);

long sroot (long i);

double sroot (double i);

int main()

{

cout << "Square root of 90.34 is: " << (sroot(90.34);

cout << "\n";

cout << "square root of 90L is: << sroot(90L);

cout << "\n";

cout << " Square root of 90 is: " << sroot (90);

return 0;

}

\\Return square root of an integer.

int sroot(int i)

{

cout << "computing integer root\n";

return (int) sqrt (( double) i);

}

\\Return square root of long.

long sroot (long i)

{

cout << "computing long root\n";

return (long) sqrt ((double) i);

}

\\Return square root of double.

double sroot (double i)

{

cout << "computing double root\n";

return sqrt(i);

}

i think the answer would be a

the difference is right there dont you see it