int main(int argc, char *argv[]){ long long seed = 0, iSqrRoot = 0, num = 2000000000; num = atoi(argv[1]); printf(" input number is %d\n", num); seed = find_RootSeed(num); iSqrRoot = sqrRoot( num, seed, seed); printf("sqr root of number is %d\n", iSqrRoot); return 0; }
int main() { float number,root; int acuCor; printf("\nEnter the number for which the square root to be found: "); scanf("%f",&number); printf("\nEnter the decimal correction in the square root: "); scanf("%d",&acuCor); root = sqrRoot(number,acuCor); printf("\n The square root of the number %f is: %f",number,root); return 0; }
long sqrRoot( long long num , long long rootseed, long long seed){ if (seed == 1){ long long i = 1, sqrroot = rootseed; while (i <= 10){ if (rootseed * rootseed > num) return sqrroot; else{ sqrroot = rootseed; rootseed = rootseed + i; } } } if ((rootseed * rootseed == num)) return rootseed; else if (rootseed * rootseed > num){ rootseed = rootseed + seed/10; sqrRoot(num, rootseed, seed/10); } else{ if ((rootseed + seed) * (rootseed + seed) < num ){ rootseed = rootseed + seed; sqrRoot(num, rootseed, seed); } else{ rootseed = rootseed + seed/10; sqrRoot(num, rootseed, seed/10); } } }