#include<iostream>
using namespace std;
void InsertSort(int *a,int m){
for(int i=1;i<m;++i)//按升序排列数组;
{
int temp=a[i];
int p=i-1;
for(;p>=0;--p)
if(a[p]>temp)
a[p+1]=a[p];
else
break;
a[p+1]=temp;
}
}
int main()
{
int a[]={78,56,21,98,79,70,123,567,876};//随机定义的数组
int m=sizeof(a)/sizeof(*a);
InsertSort(a,m);
int count=0;
for(int index=0;index<m;++index)
{ cout<<a[index]<<"\t";
count++;
if(count%8==0)
cout<<endl;
}
if(m%8!=0)
cout<<endl;
return 0;
}
using namespace std;
void InsertSort(int *a,int m){
for(int i=1;i<m;++i)//按升序排列数组;
{
int temp=a[i];
int p=i-1;
for(;p>=0;--p)
if(a[p]>temp)
a[p+1]=a[p];
else
break;
a[p+1]=temp;
}
}
int main()
{
int a[]={78,56,21,98,79,70,123,567,876};//随机定义的数组
int m=sizeof(a)/sizeof(*a);
InsertSort(a,m);
int count=0;
for(int index=0;index<m;++index)
{ cout<<a[index]<<"\t";
count++;
if(count%8==0)
cout<<endl;
}
if(m%8!=0)
cout<<endl;
return 0;
}