Commit 1e0d317

IAteNoodlesMaximSmolskiy

and

authored

Specify space complexity for merge sort (TheAlgorithms#11749)

* Added space complexity Space complexity of merge sort is a key factor, when compared to quick sort * Update merge_sort.py --------- Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru>

1 parent c5de395 commit 1e0d317Copy full SHA for 1e0d317

File tree

1 file changed

-0

lines changed

sorts
- merge_sort.py

1 file changed

-0

lines changed

`‎sorts/merge_sort.py‎`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -18,6 +18,7 @@ def merge_sort(collection: list) -> list:`
`18`	`18`	`:return: The same collection ordered in ascending order.`
`19`	`19`
`20`	`20`	`Time Complexity: O(n log n)`
	`21`	`+ Space Complexity: O(n)`
`21`	`22`
`22`	`23`	`Examples:`
`23`	`24`	`>>> merge_sort([0, 5, 3, 2, 2])`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Uh oh!

Commit 1e0d317

File tree

1 file changed

1 file changed

`‎sorts/merge_sort.py‎`

0 commit comments