d_11_1.cpp

C++应用教程原码,里面包含该书中有十三章内容的代码,详细具体

// 采用冒泡排序法，算法说明请读者自行查阅参考书籍
//
#include "stdafx.h"
#include <iostream>
#include <string>
using namespace std;

template <class Type,int size>
void sort(Type (&a)[size])
{  int i;
   bool flag = true;
   Type temp;
   while (flag)
   {
	   flag = false;
	   for (i=0;i< size-1;++i)
	   {
		   if (a[i]>a[i+1])
		   { temp = a[i];
		     a[i] = a[i+1];
			 a[i+1] = temp;
			 flag = true;
		   }
	   }
   }
}
template <class Type,int size>
void disp(Type (&a)[size])
{  int i;
   for (i=0;i<size;++i)
	   cout << a[i] <<"  ";
   cout << endl;
}
void main()
{  int a[10] = {34,45,23, 89, 10, 39, 56, 9,83,23};
   double b[10] = {34.3, 45.4, 23.34, 67.1, 89.39, 33.33, 90.05,98.8,12.2,65.88};
   string c[10] = {"ad","df","adds","dfsa","dgg","daad","xcad","sd","te","ads"};
   sort(a);
   sort(b);
   sort(c);
   disp(a);
   disp(b);
   disp(c);
   cin.get(); //等待结束，以便调测程序，可以删除
}