Not Complete

Java search class

public class Search {

  	public void binarySearch(int find, List<Integer> ds){ // Use when the data is sorted only
        int first = 0, mid, last=ds.size()-1;
        int count = 0;
        while (true){
            count++;
            mid = first + (last - first)/2;
            if (find > ds.get(mid))
                first = mid+1;
            else if (find < ds.get(mid))
                last = mid-1;
            else {
                System.out.println("Found in : " + mid);
                System.out.println("Found after " + count + " step");
                break;
            }
            if (first > last){
                System.out.println("Not found");
                break;
            }
        }
    }
	
	
}