1 can anyone tell me the algo used by below problem & provide which is
the best algo to compute square root of number.??????????????????????
2. can any one provide the solution of converting no. from base b1 to
b2 without using intermediate base.
#include<stdio.h>
#include<conio.h>
int main()
{
float a,b,e=0.00001,p,k;
//clrscr();
//textcolor(GREEN);
do {
printf("
ÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛ");
printf(" xDB PROGRAM TO FIND SQUARE ROOT OF A
NUMBERxDB");
printf("
ÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛ");
printf("ENTER A NUMBER(-1 to Quit) :");
scanf("%f",&k);
a=k;p=a*a;
while(p-k>=e)
{
b=(a+(k/a))/2;
a=b;
p=a*a;
}
printf("SQUARE ROOT IS = %f",a);
getch();
//clrscr();
}while(k!=-1);
getch();
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
