Using Babylonian algorithm to find square root

socondc22

my program is trying to use the babylonian algorithm in order to find the square root... i have a number for the number to have the square root taken of and also a number to run the loop... Whenever i go to print out the answer its rounding instead of giving me the answer i need... any help??

Expand|Select|Wrap|Line Numbers

   double num1, num2, the_root;
 
   cout<< "Enter number to have square root taken of it\n";

   cin>> num1;

   cout<< "Enter number for how many times to run Babylonian Algorithm\n";

   cin>> num2;
 
   the_root= sqrt(num1);
 
   double the_root2 = num1/2;
 
   for (double count = 1; count <= num2; count++);

    {

      the_root2=(the_root2+num1/the_root2)/2;

    ;}   
 
   cout.setf(ios::fixed);

   cout.setf(ios::showpoint);

   cout.precision(10);  

   cout<< "The root of " <<num1<<" is: "<< the_root<<".\n";

   cout<< "The root from the Babylonian Algorithm is: "<<the_root2<<".\n";

arunmib

Quote:

Originally Posted by socondc22

for (double count = 1; count <= num2; count++);

Just TAKE A LOOK at this line again.....

sicarie

socondc22-

Please have a look at your Private Messages (PM's) accessible through the link in the top right corner of the page.

Thanks

socondc22

Quote:

Originally Posted by arunmib

Just TAKE A LOOK at this line again.....

I still don't know what is wrong...

sicarie

Well, what have you tried doing on that line to fix it?

socondc22

Quote:

Originally Posted by sicarie

Well, what have you tried doing on that line to fix it?

i really don't know what is wrong with the line... like i thought it was right... i prolly need to change something but i just dont know what....

socondc22

can someone please help me to figure out why this part of my code is wrong...

for (double count = 1; count <= num2; count++);

socondc22

im trying to figure out why its stopping at the first time through the loop of my babylonian algorithm...

Ganon11

What is num2's value??

sicarie

socondc22-

Please confine your questions on the same topic to a single thread.

JosAH

Quote:

Originally Posted by socondc22

can someone please help me to figure out why this part of my code is wrong...

for (double count = 1; count <= num2; count++);

hint: It's got a sad looking winking smiley at the end ... (rotated 180 degrees)

kind regards,

Jos (<--- ps. pssst: semi-colon alert! semi-colon alert! ;-)

Using Babylonian algorithm to find square root

re: Using Babylonian algorithm to find square root

re: Using Babylonian algorithm to find square root

re: Using Babylonian algorithm to find square root

re: Using Babylonian algorithm to find square root

re: Using Babylonian algorithm to find square root

re: Using Babylonian algorithm to find square root

re: Using Babylonian algorithm to find square root

re: Using Babylonian algorithm to find square root

re: Using Babylonian algorithm to find square root

re: Using Babylonian algorithm to find square root

Similar C / C++ bytes

/bytes/development

/bytes/it

/bytes/about