c++之快速排序

各类排序算法的时间复杂度和空间复杂度的比较表

代码展示

#include<iostream> 

usingnamespace	std; 

intPartition (int*L,intlow,int high) 
{ 
	inttemp = L[low]; 
	intpt = L[low]; 
	
	while (low < high) 
	{ 
		while (low < high && L[high] >= pt) 
			--high; 
		L[low] = L[high]; 
		while (low < high && L[low] <= pt) 
			++low; 
		L[low] = temp; 
	} 
	L[low] = temp; 
	
	returnlow; 
} 

voidQSort (int*L,intlow,int high) 
{ 
	if (low < high) 
	{ 
		intpl = Partition (L,low,high); 
		
		QSort (L,low,pl - 1); 
		QSort (L,pl + 1,high); 
	} 
} 

int main () 
{ 
	intnarry[100],addr[100]; 
	intsum = 1,t; 
	
	cout << "Input number:" << endl; 
	cin >> t; 

	while (t != -1) 
	{ 
		narry[sum] = t; 
		addr[sum - 1] = t; 
		sum++; 
		
		cin >> t; 
	} 
		
	sum -= 1; 
	QSort (narry,1,sum); 
	
	for (int i = 1; i <= sum;i++) 
	cout << narry[i] << '\t'; 
	cout << endl; 
	
	intk; 
	cout << "Please input place you want:" << endl; 
	cin >> k; 
	
	intaa = 1; 
	intkk = 0; 
	for (;;) 
	{ 
		if (aa == k) 
		break; 
		if (narry[kk] != narry[kk + 1]) 
		{ 
			aa += 1; 
			kk++; 
		} 

	} 

	cout << "The NO." << k << "number is:" << narry[sum - kk] << endl; 
	cout << "And it's place is:" ; 
	for (i = 0;i < sum;i++) 
	{ 
		if (addr[i] == narry[sum - kk]) 
			cout << i << '\t'; 
	} 


	return 0; 
}