Lisajoycomputer的博客

#include #include #include #define N 10 int main(void) { int a[N] = {10,9,8,7,6,5,4,3,2,1}; for(int i=1;i=0 && a[j]>temp) { a[j+1] = a[j]; j--; ...

#include #include #include #define N 10 int main(void) { int a[N] = {10,9,8,7,6,5,4,3,2,1}; for(int i=0;i

合并两个已排好序的数组， Merge算法将会用于下一节的自底向上合并排序算法。 #include #include #include #define Low 0 #define Middle 3 #define High 10 int main(void) { int A[High+1] = {2,11,45,57,3,6,13,24,25,65,68}; ...