{
"Quicksort": "Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. Developed by Tony Hoare in 1959, with his work published in 1961, it is still a commonly used algorithm for sorting. When implemented well, it can be about two or three times faster than its main competitors, merge sort and heapsort.",
"Complexity": {
"time": "worst O(n2), best O(n log n), average O(n log n)",
"space": "worst O(n) auxiliary"
},
"References": [
"Wikipedia"
],
"files": {
"basic": "Basic"
}
}