مرحبا اخواني واخواتي دخيلكم لاتردومني عندي هالسؤال :unsure:
The Babylonian algorithm to compute the square root of a number is as follows:
1. Make a guess at the answer (you can pick n/2 as your initial guess).
2. Compute r = n/guess
3. Set guess = (guess + r)/2
4. Go back to step 2 for as many iterations as necessary. The more that steps 2 and 3 repeated, the closer guess will become to the square root of n.
Write a program that inputs an integer n, iterates through the Babylonian algorithm until guess is within 1% of the previous guess and outputs the answer as a double.
انا حاولت وكتبت هالاجابة تحت ......
الاجابة
#include <iostream>
using namespace std;
void main()
{
int n;
double guess , r;
cout << "Enter an integer : ";
cin >> n;
guess = n/2;
r = n/guess;
guess = (guess+r)/2;
cout << "The square root of " << n << " is = " << guess << endl ;
}
بس الدكتور قالي يبغيله تعديل باستخدتم while looooop بليييز ساعدوني ولاهنتوا
