THARUN1526 / QUICK-SORT-IN-PYTHON

A divide-and-conquer algorithm in Python. Select pivot, partition array, recursively sort subarrays. Place pivot in correct position, with lesser elements left, greater right. Repeat until array is sorted. Avg. time: O(n log n), space: O(log n).
18Updated last year

Related projects

Alternatives and complementary repositories for QUICK-SORT-IN-PYTHON