l9_2.cpp

《C++程序设计教程》-杨国兴-电子教案及例题 C++程序设计PPT课件 html课件 例题

#include <iostream.h>   
#include <iomanip.h>   
template <class T> 
void InsertionSort(T A[], int n) 
{ 
   int i, j; 
   T   temp; 
   // 将下标为1～n-1的元素逐个插入到已排序序列中适当的位置 
   for (i = 1; i < n; i++) 
   { 
      //从A[i-1]开始向A[0]方向扫描各元素,寻找适当位置插入A[i] 
      j = i; 
      temp = A[i]; 
      while (j > 0 && temp < A[j-1]) 
      { 
         //当遇到temp>=A[j-1]结束循环时，j便是应插入的位置 
         //当遇到j==0结束循环时，则0是应插入的位置。          
         A[j] = A[j-1];    //将元素逐个后移，以便找到插入位置时可立即插入。 
         j--; 
      } 
      A[j] = temp; 
   } 
}

void main() 
{ 
   int a[10]={2,4,1,8,7,9,0,3,5,6}; 
   double b[10]={12.1, 24.2, 15.5, 81.7, 2.7, 5.9, 40.3, 33.3, 25.6, 4.6}; 
   InsertionSort(a,10); 
   InsertionSort(b,10); 
   cout << a[0] << "  " << a[1]<< "  " << a[2] << "  " << a[3] << "  ";
   cout << a[4] << "  " << a[5]<< "  " << a[6] << "  " << a[7] << "  ";
   cout << a[8] << "  " << a[9]<< endl;
   cout << b[0] << "  " << b[1]<< "  " << b[2] << "  " << b[3] << "  ";
   cout << b[4] << "  " << b[5]<< "  " << b[6] << "  " << b[7] << "  ";
   cout << b[8] << "  " << b[9]<< endl;
}