mirror of
https://hub.njuu.cf/TheAlgorithms/Python.git
synced 2023-10-11 13:06:12 +08: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__
|
__Properties__
|
||||||
* Worst case performance O(n log n)
|
* Worst case performance O(n log n)
|
||||||
* Best case performance O(n)
|
* Best case performance O(n log n)
|
||||||
* Average case performance O(n)
|
* Average case performance O(n log n)
|
||||||
|
|
||||||
|
|
||||||
###### View the algorithm in [action][merge-toptal]
|
###### View the algorithm in [action][merge-toptal]
|
||||||
|
Loading…
Reference in New Issue
Block a user