Description: Merge sort is an O(n log n) comparison-based sorting algorithm.
1. If the list is of length 0 or 1, then it is already sorted. Otherwise:
2. Divide the unsorted list into two sublists of about half the size.
3. Sort each sublist recursively by re-applying merge sort.
4. Merge the two sublists back into one sorted list.
To Search:
File list (Check if you may need any files):
Merge Sort\main.cpp
..........\main.o
..........\Makefile.win
..........\Mergesort.cpp
..........\Mergesort.h
..........\Mergesort.o
..........\Merge_Sort.dev
..........\Merge_Sort.exe
..........\Merge_Sort.layout
Merge Sort
Download