发布时间:2016-04-12 12:51:22
#include#include#define MAX 200int R[MAX];//直接插入排序算法void Insert_Order(int n) {int i,j;for(i=2;i<=n;i++){if(R[i]<R[i-1]){R[0]=R[i];j=i-1;do{R[j+1]=R[j];j--;}while(R[0]<R[j]);}R[j+1]=R[0];}}int main(){int n;int i;printf("Please.........【阅读全文】
阅读(808) | 评论(0) | 转发(0)