Sort algorithms home |
Java | C | FORTRAN | PASCAL
sort simple sort In-place sort quicksort balanced quicksort introspective sort insertion sort selection sort diminishing increment sort shell sort heapsort adaptive heap sort introspective sort adaptive sort adaptive heap sort distribution sort bin sort range sort counting sort histogram sort merge sort |
merge sort [sort merge]
Inherits from sort
A sort algorithm which splits the items to be sorted into two groups, recursively sorts each group, and merges them into a final, sorted sequence. Run time is O(n log n). [National Institute of Standards and Technology]
Implementations and sample code: | ??? [FORTRAN]