//選擇排序法(函數(shù)模板、上浮)xuanze4f.cpp
#include<iostream.h>
#include<iomanip.h>
#include<stdlib.h>
#include<time.h>
#define M 10
template<class T>
void sortp(T d[],int size)
{int i,j,k,m;
 for(i=0;i<size-1;i++)
 {k=i;
  for(j=i+1;j<size;j++)
   if(d[k]>d[j]) k=j;
  if(i!=k)
  {T g;g=d[i];d[i]=d[k];d[k]=g;}
  for(m=0;m<size;m++) cout<<setw(7)<<d[m];
  cout<<endl;}
}
void main()
{cout<<"xuanze4f.cpp運(yùn)行結(jié)果:\n";
 int q[M],n=M,i;
 srand(time(0));
 for(i=0;i<n;i++) q[i]=rand()%100;
 cout<<"排序前數(shù)組:\n";
 for(i=0;i<n;i++)
  cout<<setw(4)<<q[i];
 cout<<endl<<"數(shù)組排序過(guò)程演示:\n";
 sortp(q,n);
 cout<<"排序后數(shù)組:\n";
 for(i=0;i<n;i++)
  cout<<setw(4)<<q[i];
 cout<<endl;
 float w[M];
 cout<<setiosflags(ios::fixed);
 for(i=0;i<n;i++) w[i]=rand()/100.0;
 cout<<"排序前數(shù)組:\n";
 for(i=0;i<n;i++)
  cout<<setprecision(2)<<setw(7)<<w[i];
 cout<<endl<<"數(shù)組排序過(guò)程演示:\n";
 sortp(w,n);
 cout<<endl<<"排序后數(shù)組:\n";
 for(i=0;i<n;i++)
  cout<<setprecision(2)<<setw(7)<<w[i];
 cout<<endl;cin.get();}