Description: Merge Sort is an efficient sorting algorithm merge operation. The algorithm is a typical application of the divide-and-conquer method (Divide and Conquer). Merge sort method is to merge the two (or more) ordered table into a new ordered table to be sorted sequence is divided into a number of sub-sequences, each sub-sequence is ordered. Then put ordered subsequence combined into the overall ordered sequence. Merger will have been ordered sub-sequence, to obtain a complete orderly sequence i.e. so that each first sub-sequence ordered, and then between the sub-sequence segment orderly. If you merge the two ordered list into an ordered table, known as the 2- way merge. The merger the sort also called merge sort.
To Search:
File list (Check if you may need any files):
MERGE SORT.cpp
Download