mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-03-23 06:59:47 +00:00
merge sort average&worst case scenarios changed
This commit is contained in:
parent
3ea683a6b9
commit
ce3e6787f4
@ -41,8 +41,8 @@ From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spe
|
||||
|
||||
__Properties__
|
||||
* Worst case performance O(n log n)
|
||||
* Best case performance O(n)
|
||||
* Average case performance O(n)
|
||||
* Best case performance O(n log n)
|
||||
* Average case performance O(n log n)
|
||||
|
||||
|
||||
###### View the algorithm in [action][merge-toptal]
|
||||
|
Loading…
x
Reference in New Issue
Block a user