1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57

void quickSort(vector<int>&nums, int left, int right) {
    if (left >= right) return;
    int privot = nums[left];//privot选择左边的数，让j指针先向左移动
    int i = left;
    int j = right;
    while(i < j) {
        while(nums[j] >= privot && i < j) {
            j--;
        }
        while(nums[i] <= privot && i < j) {
            i++;
        }

        if (i<j) {
            swap(nums[i], nums[j]);
        }
    }
    for(auto it : nums) {
        cout << it << " ";
    }
    cout << endl;

    swap(nums[left], nums[i]);//i==j时

    quickSort(nums, left, i-1);
    quickSort(nums, i+1, right);
}

vector<int> sortArray(vector<int>& nums) {
  	quickSort(nums, 0, nums.size()-1);
 		return nums;
}

//快速排序，从大到小
//AC
void quickSort2(vector<int>&nums, int left, int right) {
    if (left >= right) return;
    int privot = nums[left];
    int i = left;
    int j = right;
    while(i < j) {
        while(nums[j] <= privot && i < j) {
            j--;
        }
        while(nums[i] >= privot && i < j) {
            i++;
        }

        if (i<j) {
            swap(nums[i], nums[j]);
        }
    }

    swap(nums[left], nums[i]);
    quickSort2(nums, left, i-1);
    quickSort2(nums, i+1, right);
}