摘要： [代码]Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-- 1 #include stdio.h 2 3 int main(int argc, char** argv) 4 { 5 int array[] = {1, 3, 5, 24, 35, 45, 67, 73, 76, 78, 98, 99, 200, 201, 202, 455, 3445}; 6 int length = sizeof(array)/sizeof(int); 7 in 阅读全文

摘要： [代码]Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-- 1 #include stdlib.h 2 3 void merge2(int array[], int low, int mid, int high) 4 { 5 int i, k; 6 int *temp = (int *)malloc((high - low + 1) * sizeof(int)); 7 int begin1 = low; 8 int end1 = mid; 9 阅读全文

摘要： [代码]Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-- 1 #include stdio.h 2 3 int main(int argc, char** argv) 4 { 5 int nums[] = {1, 423, 43,534,2,4,7,8,9,54,10,34,45}; 6 int length = sizeof(nums)/sizeof(int); 7 int i,j,min,temp; 8 9 for (i = 0; i 阅读全文

摘要： [代码]Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-- 1 #include stdio.h 2 3 void insertion_sort(int array[], unsigned int first, unsigned int last) 4 { 5 int i, j, k; 6 int temp; 7 8 int start = first; //直接用first在内层循环会产生未知错误 9 10 for (i = start + 阅读全文

摘要： [代码]Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-- 1 #include stdio.h 2 3 int main(int argc, char** argv) 4 { 5 int nums[] = {1, 423, 43,534,2,4,7,8,9,54,10,34,45}; 6 int length = sizeof(nums)/sizeof(int); 7 int i = 0, j = 0, temp = 0; 8 9 prin 阅读全文