- put(k,v): Binary search for a key equal to k (time O(log(N))), but then to insert a new key all larger keys (and values) must be copied to the next index. In worst case N keys and values must be copied. Time: O(N)
- v = get(k): Binary search. Time: O(log(N))
- delete(k): Similar to put. Binary search for k (time O(log(N))), but keys greater than k must be copied to previous index. Time: O(N)