Square root using binary search method - Java

public class SquareRoot {

public static void main(String[] args) {
double squareRoot = sqRoot(6.25);
System.out.println(squareRoot);
}

public static double sqRoot(double d) {
double start = 0;
double end = d;

while(end > start){
double mid = (start + end)/2;
if(mid * mid == d)
return mid;
else if(mid * mid > d){
end = mid;
}else if (mid * mid < d){
start = mid;
}
}
return d;
}
}