lab

代码说明：

  对于初始给定的数组,通常存在多个长度大于1的已自然排好序的子数组段.例如,若数组a中元素为{4,8,3,7,1,5,6,2},则自然排好序的子数组段有{4,8},{3,7},{1,5,6},{2}.用一次对数组a的线性扫描就足以找出所有这些排好序的子数组段.然后将相邻的排好序的子数组段两两合并,构成更大的排好序的子数组段({3,4,7,8},{1,2,5,6}).继续合并相邻排好序的子数组段,直至整个数组已排好序。(For the initial given array, usually present multiple sub-array section has a length greater than a natural sorted. For example, if the array of elements for a {4,8,3,7,1,5,6,2} then naturally sorted subarray segment has {4,8}, {3,7}, {1,5,6}, {2}. used once on a linear array scanning is sufficient to identify all these rows subarray segments good sequence is then sub-arrays adjacent segments sorted pairwise merge to form larger sub-segments sorted array ({3,4,7,8}, {1, 2, 5,6}). Continue merge adjacent sorted subarray section until the entire array is sorted.)

文件列表：

lab.cpp,1970,2014-12-21