forked from algorithm-visualizer/algorithm-visualizer
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdesc.json
More file actions
13 lines (13 loc) · 690 Bytes
/
desc.json
File metadata and controls
13 lines (13 loc) · 690 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
{
"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(n<sup>2</sup>), best O(n log n), average O(n log n)",
"space": "worst O(n) auxiliary"
},
"References": [
"<a href='https://en.wikipedia.org/wiki/Quicksort'>Wikipedia</a>"
],
"files": {
"basic": "Quicksort"
}
}