Binary Search Summary

Find a place to insert an element

[1, 3, 5, 7, 9]

insert 4

public int find(int start, int end, int key, int[] sums){        while(start <= end){            int mid = (start + end) / 2;            if(sums[mid] < key){                start = mid + 1;            }else{                end = mid - 1;            }        }        return start;    }