SWUST OJ 413：Quick Sort

一、题目描述

Quicksort is a well-known sorting algorithm developed by C. A. R.

Hoare that, on average, makes Θ(n log n) comparisons to sort n items. However, in the worst case, it makes Θ(n2) comparisons. Typically, quicksort is significantly faster in practice than other Θ(n log n) algorithms, because its inner loop can be efficiently implemented on most architectures, and in most real-world data it is possible to make design choices which minimize the possibility of requiring quadratic time.

Quicksort sorts by employing a divide and conquer strategy to divide a list into two sub-lists.

The steps are:

1. Pick an element, called a pivot, from the list.

2. Reorder the list so that all elements which are less than the pivot come before the pivot and so that all elements greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot is in its final position. This is called the partition operation.

3. Recursively sort the sub-list of lesser elements and the sub-list of greater elements. The base case of the recursion are lists of size zero or one, which are always sorted. The algorithm always terminates because it puts at least one element in its final place on each iteration (the loop invariant).

Quicksort in action on a list of random numbers. The horizontal lines are pivot values. Write a program to sort ascending int number by QuickSort ,n less than 50000.

二、输入

two lows, the first low is numbers , less and equal than 50000. the second low is a set integer numbers

三、输出

a set integer numbers of sort ascending

四、样例输入复制

10
4 2 1 5 7 6 9 8 0 3

五、例输出复制

0 1 2 3 4 5 6 7 8 9

六、解题方法

法一：sort投机取巧

（可能考试系统过不了）

当然就是用sort来投机取巧，这里不做过多介绍

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    int arr[n];
    for(int i = 0; i<n; i++){
    	cin >> arr[i];
	}
	sort(arr,arr+n);
	for(int i = 0; i<n; i++){
    	cout << arr[i] << " ";
	}
	cout <<endl;
    return 0;
}

法二：快排

注意：避免出现runtime error:应该使用了std::vector而不是数组：因为它提供了动态数组的功能，并且更容易处理边界情况。当使用数组时，需要手动管理数组的长度和边界，而std::vector则自动管理这些。

#include <iostream>
using namespace std;
#include "vector"
 

// 注意点1：注意使用要改变数组的值的话必须要使用&
void quickSortArr(vector<int> &arr, int begin ,int end) {
    int l = begin;
    int r = end;
    //注意点2：这里的判断语句是必须的
    if(l >= r) {
        return;
    }
    int val = arr[l];
    //注意点3：注意循环条件是可以取等的
    while (l <= r) {
        while (arr[r] > val) {
            r--;
        }
        while (arr[l] < val) {
            l++;
        }
    //注意点4：交换之前也要判断一下
        if(l<=r)
        {
        swap(arr[l],arr[r]);
        l++;
        r--;    
        }

    }
 //注意点5：注意左区间取值的右边界和右区间取值的左边界
    quickSortArr(arr,begin,r); // 左
    quickSortArr(arr,l,end); // 右 
}
// 快速排序
int main() {
    int n;
    cin >> n;
    vector<int> arr;
    for (int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        arr.push_back(a);
    }
 
    quickSortArr(arr,0,n - 1);
 
    for (int i = 0; i < arr.size(); ++i) {
        cout << arr[i] << " ";
    }
    cout << endl;
    return 0;
}