#include <stdio.h> void insert_sort(int s[],int n){ int temp,i,j; for (i=1;i<10;i++) { temp=s[i]; j=i; while(temp<s[j-1]){ s[j]=s[j-1]; j--; } s[j]=temp; } } void main(){ int a[10],i; printf("please input the number :/n"); for (i=0;i<10;i++) { scanf("%d",&a[i]); } printf("the original order:/n"); for (i=0;i<10;i++) { printf("%5d",a[i]); } insert_sort(a,10); printf("the ordered number is /n"); for (i=0;i<10;i++) { printf("%5d",a[i]); } } 插入排序:序列前半部分有序,后半部分无序