-
Notifications
You must be signed in to change notification settings - Fork 0
/
SquareRoot.java
44 lines (38 loc) · 1.2 KB
/
SquareRoot.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
// Approach: Modified Binary Search
// Time complexity: O(log n)
// Space complexity: O(1)
import java.util.*;
import java.io.*;
public class SquareRoot {
public static int findSquareRoot(int num){
int low=0, high=num, result=-1;
//modified binary search
while(low <= high){
int mid = low + (high - low)/2;
long val = mid * mid;
if(val == num){
// prefect square root
return mid;
}
else if(val < num){
// store the floor value, incase the number is not perfect square root, we can print the floor value
result = mid;
low = mid + 1;
}
else{
high = mid - 1;
}
}
return result;
}
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number of which you want the square root: ");
int num = sc.nextInt();
// function calling
int result = findSquareRoot(num);
System.out.println("Square root of the given number is: "+result);
}
}
SquareRoot.java
Displaying SquareRoot.java.