Sorting Arrays and Binary Search

We consider the following code :

public static void main(String[] args)
{
    int[ ] ar={34,2,132,67,5,99,76,1,503 };
    int where;

    sort(ar);
    where=find(ar,76);
    System.out.println("where is "+where);

    where=find(ar,505);
    System.out.println("where is "+where);

    where=find(ar,2);
    System.out.println("where is "+where);

}

Your assignment is to implement both sort and find. sort is to employ the insertion sort algorithm (we covered this in class) and find is to implement binary search (again, covered in class).