mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
merge sort average&worst case scenarios changed (#340)
This commit is contained in:
commit
73ae8f2dd9
|
@ -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