Snippets tagged merge sort
-
Merge Sort on List
Merge Sort falls into 'Divide and Conquer' problem solving technique and it is a stable sorting. The worst case of running time is (nlogn). This implementation below follows the two abstract steps to achieve Merge Sort, i.e., * Recursively divide input list into two sub-lists. * Repeatedly merge the sub-lists.
5 people like this
Like the snippet!Posted: 12 years ago by Joel Huang
-
Merge Sort of int lists
A basic recursive implementation of merge sort on lists of ints.
1 people like this
Like the snippet!Posted: 11 years ago by Bret Colloff