Why is this problem categorized as hard?


  • 0
    A

    Everybody knows binary search. No matter you try to find the pivot first or not, the complexity of O(logN) doesn't change.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.