摘要：
插入排序：#include <stdio.h>#include <sys/time.h>#include <unistd.h>#include <stdlib.h> voidchange_node ( int data[], int head, int start, int end ){int j =0; for(j = end; j > start; j--) { data[j] = data[j-1]; } data[start] = head; return ;} /* ----- end of function chan... 阅读全文