algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-07 09:45:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
Christian Bender
2018-03-29 16:30:19 +02:00
committed by GitHub
parent 757ad7f47e
commit 4d435994d7
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@ -40,9 +40,9 @@ __Properties__
From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spelt mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945. From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spelt mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945.
__Properties__ __Properties__
* Worst case performance O(n log n) * Worst case performance O(n log n) (typical)
* 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]