main.cpp

实现快速排序法

#include <iostream.h>

int divide(int *matric, int i, int j)
{
	int temp;
	temp = matric[i];

	while (i != j)
	{
		while ((i<j) && (matric[j] > temp))
		{
			j--;
		}
		if (i<j)
			matric[i++] = matric[j];
		while ((i<j) && (matric[i] < temp))
		{
			i++;
		}
		if (i<j)
			matric[j--] = matric[i];
	}
	matric[i] = temp;
	return i;

}

void quicksort(int *matric, int m, int n)
{
	int i;

	if (m<n)
	{
		i = divide(matric,m,n);
		quicksort(matric,m,i-1);
		quicksort(matric,i+1,n);
	}
}

void main()
{
	int i;
	int n;
	int in;
	cout<<"the lenght of the matric you want to sort :"<<endl;
	cin>>n;

	int *matric;
	matric = new int[n];
	cout<<"input the datas"<<endl;
	for (i=0; i<n; i++)
	{
		cin>>in;
		matric[i] = in;
	}

	quicksort(matric, 0, n-1);

	for (i=0; i<n; i++)
	{
		cout<<"    "<<matric[i];
	}

}