fix: document heap sorts space complexity to O(1) (#219) · bigjohncodes/TypeScript@4acf117 · GitHub

bigjohncodes / TypeScript Public

forked from TheAlgorithms/TypeScript

• Notifications You must be signed in to change notification settings
• Fork 0
• Star 0

• Code
• Pull requests
• Actions
• Projects
• Security and quality
• Insights

Additional navigation options

Commit 4acf117

Browse filesBrowse the repository at this point in the historyBrowse files

caojoshua

authored

fix: document heap sorts space complexity to O(1) (TheAlgorithms#219)

1 parent e0ae744 commit 4acf117
Copy full SHA for 4acf117

1 file changed

+1-1Lines changed: 1 addition & 1 deletion

File tree

Expand file treeCollapse file tree

Open diff view settings

Filter options

• sorts
  • heap_sort.ts

Expand file treeCollapse file tree

Open diff view settings

Collapse file

‎sorts/heap_sort.ts‎

Copy file name to clipboardExpand all lines: sorts/heap_sort.ts

+1-1Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
@@ -4,7 +4,7 @@
4	4	* @see [Heap Sort](https://www.geeksforgeeks.org/heap-sort/)
5	5	* @example MergeSort([7, 3, 5, 1, 4, 2]) = [1, 2, 3, 4, 5, 7]
6	6	* @Complexity_Analysis
7		- * Space complexity - O(n)
	7	+ * Space complexity - O(1)
8	8	* Time complexity
9	9	* Best case - O(nlogn)
10	10	* Worst case - O(nlogn)

0 commit comments

Comments

0 (0)