Find SQRT with help of Binary Search

FindSqrt.java

public class FindSqrt {

	public static int sqrt(int no) {
		int result = 0;
		int low = 0, high = (no / 2), mid = 0;
		int midVal = 0;
		while (low <= high) {

			mid = (low + high) / 2;
			System.out.println("Mid Point :" + mid);

			midVal = mid * mid;

			if (midVal == no) {
				result = mid;
				break;
			} else if (midVal > no) {
				high = mid - 1;

			} else if (mid < no) {
				low = mid + 1;
			}
		}

		return result;
	}

	public static void main(String[] args) {
		System.out.println("Final ::" + sqrt(64));
	}

}
/*
Output :

Mid Point :16
Mid Point :7
Mid Point :11
Mid Point :9
Mid Point :8
Final ::8


*/