Tag Archives: sort

Quick Sort

This quick sort implementation comes from ‘Programming Pearls’ by Jon Bentley. The basic idea of quick sort is ‘divided and conquer’. Choose the pivot Partitioning the array to have half the elements are above the pivot and half the elements … Continue reading

Posted in Algorithms, Technical Interview | Tagged , | Leave a comment