Write an algorithm to find the missing number from a sorted list of n numbers where the numbers range over m and \( m>>n \). Your algorithm should beat O(logn) running time and n is large enough to span multiple disk.