1.13
#include <iostream>
#include <string>
using namespace std;
int main( )
{
longa[5]={10100,-123567, 1198783,-165654, 3456};
intb[5]={1,9,0,23,-45};
floatc[5]={2.4, 7.6, 5.5, 6.6, -2.3 };
voidsort(long [ ]);
void sort(int [ ]);
voidsort(float [ ]);
sort(a);
sort(b);
sort(c);
return 0;
}
void sort(long a[ ])
{int i, j;
long t;
for (j=0;j<5; j++)
for(i=0;i<5-j;i++)
if(a[i]>a[i+1])
{t=a[i];a[i]=a[i+1];a[i+1]=t;}
cout<<"the sorted numbers : "<<endl;
for(i=0;i<5;i++)
cout<<a[i]<< " ";
cout<<endl<<endl;
}
void sort(int a[ ])
{int i, j, t;
for (j=0;j<5; j++)
for(i=0;i<5-j;i++)
if(a[i]>a[i+1])
{t=a[i];a[i]=a[i+1];a[i+1]=t;}
cout<<"the sorted numbers : "<<endl;
for(i=0;i<5;i++)
cout<<a[i]<< " ";
cout<<endl<<endl;
}
void sort(float a[ ])
{int i, j;
floatt;
for(j=0;j<5;j++)
for(i=0;i<5-j;i++)
if(a[i]>a[i+1])
{t=a[i];a[i]=a[i+1];a[i+1]=t;}
cout<<"the sorted numbers : "<<endl;
for(i=0;i<5;i++)
cout<<a[i]<< " ";
cout<<endl<<endl;
}
1.14
#include <iostream>
#include <string>
using namespace std;
int main( )
{ long a[5]= {10100,-123567, 1198783,-165654, 3456};
int b[5]={1,9,0,23,-45};
floatc[5]={2.4, 7.6, 5.5, 6.6, -2.3 };
voidsort(int [ ]);
voidsort(float [ ]);
voidsort(long [ ]);
sort(a); //对长整型数据排序
sort(b); //对整型数据排序
sort(c); //对单精度型数据排序
return 0;
}
void sort(long a[ ]) //对长整型数据用选择法排序的函数
{int i,j,min;
long t;
for(i=0;i<5;i++)
{min=i;
for(j=i+1;j<5;j++)
if(a[min]>a[j]) min=j;
{t=a[i]; a[i]=a[min]; a[min]=t; }
cout<<"the sorted numbers : "<<endl;
for(i=0;i<5;i++)
cout<<a[i]<<" ";
cout<<endl<<endl;
}
void sort(int a[ ]) //对整型数据用选择法排序的函数
{int i, j, t;
for (j=0;j<5; j++)
for(i=0;i<5-j;i++)
if(a[i]>a[i+1])
{t=a[i];a[i]=a[i+1];a[i+1]=t;}
cout<<"the sorted numbers : "<<endl;
for(i=0;i<5;i++)
cout<<a[i]<< " ";
cout<<endl<<endl;
}
void sort(float a[ ]) //对单精度型数据用起泡法排序的函数
{int i, j;
float t;
for(j=0;j<5;j++)
for(i=0;i<5-j;i++)
if(a[i]>a[i+1])
{t=a[i];a[i]=a[i+1];a[i+1]=t;}
cout<<"the sorted numbers : "<<endl;
for(i=0;i<5;i++)
cout<<a[i]<< " ";
cout<<endl<<endl;
}