Merge pull request #478 from ushmita4/master

#433 Finding Square Root of a number using Newton Rhapson Method.

Author: smv1999

Numbers/SquareRoot.java

@@ -0,0 +1,24 @@
+import java.io.*;
+public class SquareRoot
+{
+    /* Time Comeplexity:-O(lg(n))
+    Space Complexity:- O(1)**/
+    public static void main(String args[])throws IOException
+    {
+        InputStreamReader read=new InputStreamReader(System.in);
+        BufferedReader in=new BufferedReader(read);
+        System.out.println("Enter your number");
+        int n=Integer.parseInt(in.readLine());
+        int x=n;
+            if(x<=1)
+                System.out.println(x);
+            int sqrt=x/2;
+            int quotient=x/sqrt;
+            while(sqrt>quotient)
+            {
+                sqrt=(sqrt+quotient)>>1;//bitwise operator used to make the process faster
+                quotient=x/sqrt;   
+            }
+            System.out.println("The square root of the number "+n+" is = "+sqrt);
+        }
+    }