merge sort average&worst case scenarios changed

This commit is contained in:
HasanGokdag 2018-09-13 13:17:36 +02:00
parent 3ea683a6b9
commit ce3e6787f4

View File

@ -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]