sortexp.cpp

内排序算法

#include <iostream>
using namespace std;


void BubbleSort(int r[], int n);                  //冒泡排序
void QuickSort(int r[], int first, int end);      //快速排序

int main()
{
	int i,j;
	const int numv=11;                                //赋值
	int a[]={38,23,56,2,79,42,93,29,6,5,57};
	int b[]={50,23,45,67,87,14,29,32,44,97,89};
	
	cout << "\n冒泡排序前：" << "\n";                 //冒泡排序
	for(int k=0;k<numv;k++)
		cout<<a[k]<<" ";
	cout << "\n冒泡排序结果为：" << "\n";
	BubbleSort(a, numv);

	cout << "\n快速排序前：" << "\n";                 //快速排序
	for(j=0;j<numv;j++)
		cout<<b[j]<<" ";
	cout << "\n快速排序结果为：" << "\n";             
	QuickSort(b, 0, numv-1);
	for(i=0; i < numv; i++)
		cout<<b[i]<<" ";
	cout<<"\n";
	return 0;
}