merge sort

• Algorithms Lesson 3: Merge Sort

http://www.youtube.com/watch?v=GCae1WNvnZM

• merge sort with game cards

http://www.youtube.com/watch?v=dVaHHwtf8KM

• Merge Sort Tutorial

http://www.youtube.com/watch?v=ayN8nBiqg5I&feature=related
similar to quick sory
divide and conquer strategy

• Merge sort

Merge sort (also commonly spelled mergesort) is an O(n log n) comparison-based sorting algorithm
Merge sort is a divide and conquer algorithm

Conceptually, a merge sort works as follows
Divide the unsorted list into n sublists, each containing 1 element (a list of 1 element is considered sorted).
Repeatedly Merge sublists to produce new sublists until there is only 1 sublist remaining. This will be the sorted list.

http://en.wikipedia.org/wiki/Merge_sort