bubblesort.h

有各种排序算法

#include"DataList.h"
#include<iostream>
using namespace std;
template<class T>
void BubbleSort(dataList<T>&d)
{
	int n = d.GetSize();
	int change = 0;//change为0时把最大元素放到最后，为1时把最小元素放到最前
	bool exchange;
	for(int i = 1;i < n;i ++)
	{
		exchange = false;
		if(change == 0)
		{
			for(int j = i;j < n;j ++)
				if(d.Vector[j-1]> d.Vector[j])
				{
					Element<T> temp = d.Vector[j-1];
					d.Vector[j-1] = d.Vector[j];
					d.Vector[j] = temp;
					exchange = true;
				}
			cout << d << endl;
			change = 1;
		}
		if(change == 1)
		{
			for(int j = n-1;j >= i;j --)
				if(d.Vector[j-1] > d.Vector[j])
				{
					Element<T> temp = d.Vector[j-1];
					d.Vector[j-1] = d.Vector[j];
					d.Vector[j] = temp;
					exchange = true;
				}
			cout << d << endl;
			change = 0;
		}
		if(exchange == false) return;
	}
}