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) · 738 Bytes
/
desc.json
File metadata and controls
13 lines (13 loc) · 738 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
{
"Heap Sort": "Heapsort is a comparison-based sorting algorithm. Heapsort can be thought of as an improved selection sort: like that algorithm, it divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region. The improvement consists of the use of a heap data structure rather than a linear-time search to find the maximum.",
"Complexity": {
"time": "worst $O(n \\, log \\, n)$, best $O(n \\, log \\, n)$, average $O(n \\, log \\, n)$",
"space": "worst $O(1)$ auxiliary"
},
"References": [
"<a href='https://en.wikipedia.org/wiki/Heapsort'>Wikipedia</a>"
],
"files": {
"basic": "Heap sort"
}
}