WAP find square root of any number (without using sqrt() )?
Answers were Sorted based on User's Feedback
Answer / bhavya b
square of a no: n is the sum of first n odd no: for eg ..square of 7 is 1+3+5+7+9+11+13=49...
so we can find sqrt(m) by decrementing odd no:s from m upto m become 0 or less..then the no: of odd no:'s decremented will give the sqrt(m).
int sqroot(int m){
int n=0,i=1;
while(m>0){
m=m-i;
i+=2;
n++;
}
return(n);
}
| Is This Answer Correct ? | 6 Yes | 2 No |
Answer / akash dilwaria
#iclude<iostream.h>
#nclude<conio.h>
void main()
{
clrscr();
int n;
float sqrt;
cout<<"\n enter the number";
cin>>n;
sqrt=pow(n,0.5);
cout<<"\n square root of a number is="<<sqrt;
getch();
}
| Is This Answer Correct ? | 2 Yes | 3 No |
Answer / avinash
private int sqrt()
{
int n = console.readline();
n = n*n;
return n;
}
| Is This Answer Correct ? | 5 Yes | 11 No |
How does polymorphism work?
Is enum a class?
Out of 4 concepts, which 3 C++ Follow?
What is the purpose of enum?
Can private class be inherited?
What is a linked list?
What is class encapsulation?
What is the use of oops?
Why u change company?
What is oop in simple words?
What is property in oops?
Finding of the 4 larger (bigger) numbers from the list like{1245,4587,2145,1163,29987,65783.....}