paixu.cpp

本代码实现了几乎所有的排序算法

#include<iostream.h>
#include"ShellSort.h"//蔡龙兵
#include"Radix.h"//张乐
#include"Selection.h"//杨晓宇
#include"MergeSort.h"//都洪宇
#include"DuiSort.h"//冒荣
#include"BubbleSort.h"//卢光峰
#include"InsertSort.h"//宋建平
#include"QuickSort.h"//常建龙


void Enter(int *Array,int size)
{
		cout<<"请输入数组中的元素:"<<endl;
		for(int i=0; i<size; i++)
			cin>>Array[i];
		cout<<endl;
}
void Print(int *Array,int size)
{
		for(int i=0;i<size;i++)
			cout<<Array[i]<<"  ";
		cout<<endl;
}

void main()
{
	int work=1;
	while(work==1)
	{
		cout<<"*************数组排序************"<<endl;
		cout<<"***1  插入排序"<<endl;
		cout<<"***2  选择排序"<<endl;
		cout<<"***3  冒泡排序"<<endl;
		cout<<"***4  希尔排序"<<endl;
		cout<<"***5  快速排序"<<endl;
		cout<<"***6  归并排序"<<endl;
		cout<<"***7  堆排序"<<endl;
		cout<<"***8  基数排序"<<endl;
		cout<<"*********************************"<<endl;
		int chioce;
		cout<<"请选择:	";
		cin>>chioce;
		cout<<endl<<endl;
		if(chioce>=1&&chioce<=8&&!cin.eof())
		{
			int size;
			cout<<"请输入数组大小:  ";
			cin>>size;
			cout<<endl;
			int *Array=new int[size];
			Enter(Array,size);
		
			Dui heap(size);
			cout<<"**********************************"<<endl;
			switch(chioce)
			{
			case 1:
				InsertSort(Array,size);
				break;
			case 2:
				SelectSort(Array,size);
				break;
			case 3:
				BubbleSort(Array,size);
				break;
			case 4:
				ShellSort(Array,size);
				break;
			case 5:
				QuickSort(Array,size);
				break;
			case 6:
				mergesort(Array,size);
				break;
			case 7:
				heap.HeapSort(Array,size);
				break;
			case 8:
				RadixSort(Array,size,3,10);
				break;
			default:
				break;
			}
			cout<<"**********************************"<<endl;
			cout<<"最终排序结果:"<<endl;
			Print(Array,size);
			cout<<endl<<endl;
		}
		else
		{
			cout<<"输入错误,请重试!"<<endl<<endl;
			cin.clear();
		}

		do{
			if(cin.eof())
			{
				cout<<"输入错误,请重试!"<<endl;
				cin.clear();
			}
			cout<<"继续请输入1,返回按其他键:  ";	
			cin>>work;
		}while(cin.eof());
	}
}