8000 fix: document heap sorts space complexity to O(1) (#219) · Algorithms-Learn/TypeScript@4acf117 · GitHub
[go: up one dir, main page]
Skip to content

Commit 4acf117

Browse files
caojoshuacaojoshua
authored
fix: document heap sorts space complexity to O(1) (TheAlgorithms#219)
1 parent e0ae744 commit 4acf117

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎sorts/heap_sort.ts

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* @see [Heap Sort](https://www.geeksforgeeks.org/heap-sort/)
55
* @example MergeSort([7, 3, 5, 1, 4, 2]) = [1, 2, 3, 4, 5, 7]
66
* @Complexity_Analysis
7-
* Space complexity - O(n)
7+
* Space complexity - O(1)
88
* Time complexity
99
* Best case - O(nlogn)
1010
* Worst case - O(nlogn)

0 commit comments

Comments
 (0)
0