/
912. Sort an Array.cpp
49 lines (41 loc) · 1.04 KB
/
912. Sort an Array.cpp
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
// https://leetcode.com/problems/sort-an-array/
class Solution
{
public:
vector<int> sortArray(vector<int> &nums)
{
quickSort(nums, 0, nums.size() - 1);
return nums;
}
void quickSort(vector<int> &nums, int left, int right)
{
if (left >= right)
return;
int pivotIndex = Partition(nums, left, right);
quickSort(nums, left, pivotIndex - 1);
quickSort(nums, pivotIndex, right);
}
int Partition(vector<int> &nums, int left, int right)
{
int pivotIndex = left + (right - left) / 2;
int pivotValue = nums[pivotIndex];
int i = left, j = right;
int temp;
while (i <= j)
{
while (nums[i] < pivotValue)
i++;
while (nums[j] > pivotValue)
j--;
if (i <= j)
{
temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
i++;
j--;
}
}
return i;
}
};