exchangesort.cpp

来自「用C++编的排序的操作,这个是快速排序,有时间我会多上载几个别的」· C++ 代码 · 共 37 行

#include <iostream.h>

void Swap(int &x,int &y)
{
	int temp = x;
	x = y;
	y = temp;
}

void ExchangeSort(int a[],int n)
{
	int i,j;
	for(i = 0; i < n-1; i++)
	{
		for(j = i+1; j < n; j++ )
			if(a[i] > a[j])
				Swap(a[i],a[j]);
	}
}

void PrintList(int a[],int n)
{
	for(int i = 0; i < n; i++ )
		cout <<a[i] <<" ";
	cout << endl;
}

void main()
{
	int list[15] = {23,43, 4,34,45,56,67,45,67,34,67,3,67,87,65};

	cout << "Original list \n";
	PrintList(list,15);
	ExchangeSort(list,15);
	cout << endl <<"Sorted List" << endl;
    PrintList(list,15);
}