How to efficiently sort a pivoted array

Question

BDutta · Accepted Answer

1. Find the pivot.
2. Reverse the left side until the pivot.
3. Reverse the right side after pivot.
4. Reverser the whole array.

No need for extra storage and it's still O(n).

Alan · Answer

Array is already sorted so 
1) find the pivot point (use modified binary search)
2) since it is a array, block copy data using temporary buffer to reconstruct the sorted array

Google

Domanda di colloquio di Google

Risposte di colloquio

Aziende seguite

Ricerche di lavoro