/****
// i: the begin index of old sub-array, j: the begin index of even sub-array
|
array [0,1,2,3] [4,5,6,7][8,9]
^ ^ ^
i j arrLen
****/
//merge sort using no recursion
func mergeSort2(array []int){
arrLen := len(array);
if arrLen
Original: https://www.cnblogs.com/seaman9/p/16041206.html
Author: 黄焱青
Title: go实用编程-算法篇 -归并排序
原创文章受到原创版权保护。转载请注明出处:https://www.johngo689.com/516376/
转载文章受原作者版权保护。转载请注明原作者出处!