<div class="content-rich-box rich-text-" ><div class="law-answer-wrapper-highlight">
#include <stdio.h>
#define N 100
void insert(int a[],int n,int x) {
int i,j;
for(i = 0;i < n; ++i) {
if(x <= a) {
for(j = n; j > i; --j)
a[j] = a[j - 1];
a[j] = x;
return;
}
}
a[n] = x;
}
void sort(int a[], int n) {
int i,j,k,t;
for(i = 0; i < n - 1;++i) {
k = i;
for(j = i + 1;j < n; ++j) {
if(a[j] < a[k]) k = j;
}
if(k != i) {
t = a;
a = a[k];
a[k] = t;
}
}
}
void show(int a[], int n) {
int cnt = 0;
for(int i = 0;i < n; ++i) {
if(cnt && cnt%10 == 0) printf("\n");
++cnt;
printf("%d ",a);
}
if(cnt%10) printf("\n");
}
int main() {
int i,x,n,a[N];
printf("n = ");
scanf("%d",&n);
for(i = 0;i < n; ++i) scanf("%d",&a);
sort(a,n);
printf("\n排序后:\n");
show(a,n);
printf("\n输入要插入的数:");
scanf("%d",&x);
insert(a,n,x);
printf("\n插入%d后:\n",x);
show(a,n + 1);
return 0;
} |