Suppose you are given an array of sorted integers that has been

circularly shifted K positions to the right. For example taking ( 1 3 4 5 7)

and circularly shifting it 2 positions to the right you get ( 5 7 1 3 4 ).

Design an efficient algorithm for finding K.