C 關於”合併排序法(Merge Sort)” - Yahoo!奇摩知識+
輸入:正整數n,未排序的陣列S[0..n-1] 輸出:已排序的陣列S 演算法:(c) void mergesort(index low, index high) {index mid; if(low high) {mid = (low+high)/2; //算出頭尾的中間值 mergesort(low, mid); //把頭和中間值之間的陣列作合併排序法tw.knowledge.yahoo.com/question/question?qid=1506120806541 庫...