Description: Merge sort, using a typical application of divide and conquer method. The main steps can be simply described as: [] The first step in ascending order: the array is divided into left and right arrays, then recursively until around the array contains only a single element [bottom] Step Two: Start from a single element, merge array, making the value of a small layer on the left side of the array, the value in the right layer of the large array, and then recursively until the top level to the original array [].
To Search:
File list (Check if you may need any files):
MergeSort
.........\MergeSort
.........\.........\Debug
.........\.........\.....\BuildLog.htm
.........\.........\.....\main.obj
.........\.........\.....\MergeSort.exe
.........\.........\.....\MergeSort.exe.embed.manifest
.........\.........\.....\MergeSort.exe.embed.manifest.res
.........\.........\.....\MergeSort.exe.intermediate.manifest
.........\.........\.....\MergeSort.ilk
.........\.........\.....\MergeSort.pdb
.........\.........\.....\mt.dep
.........\.........\.....\vc90.idb
.........\.........\.....\vc90.pdb
.........\.........\main.cpp
.........\.........\MergeSort.ncb
.........\.........\MergeSort.sln
.........\.........\MergeSort.suo
.........\.........\MergeSort.vcproj
.........\.........\MergeSort.vcproj.jim-PC.jim.user
.........\白话经典算法系列之五 归并排序的实现 - MoreWindows Blog - 微软最有价值专家的个人技术博客 - 博客频道 - CSDN.pdf
Download