#include <iostream>
#include<bits/stdc++.h>
using namespace std;
void InsertSort(int *a,int length){
int j;
for(int i=1;i<length;i++){
int t=a[i];
for(j=i-1;j>=0;j--){
if(t<a[j]){
a[j+1]=a[j];
}else break;
}
a[j+1]=t;
}
}
int main()
{
int a[100];
int x,i=0;
cin>>x;
while(x){
a[i++]=x;
cin>>x;
}
InsertSort(a,i);
for(int j=0;j<=i-1;j++)
cout<<a[j]<<" ";
//cout << "Hello world!" << endl;
return 0;
}
8545 Direct insertion sort
Guess you like
Origin blog.csdn.net/changbaishannefu/article/details/111648323
Recommended
Ranking