merge sort average&worst case scenarios changed (#340)

This commit is contained in:
Anshul 2018-09-28 09:45:34 +05:30 committed by GitHub
commit 73ae8f2dd9
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

View File

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