本道题目专用于练习排序算法,后续会补齐其他排序算法的代码
归并排序
class Solution {
public:
vector<int> sortArray(vector<int>& nums) {
vector<int> temp(nums.size());
MergeSort(nums, temp, 0, nums.size() - 1);
return nums;
}
void MergeSort(vector<int>& nums,vector<int>&temp,int l,int r) {
if (l<r)
{
int mid = l + (r - l) / 2;
MergeSort(nums, temp, l, mid);
MergeSort(nums, temp, mid + 1, r);
Merge(nums, temp, l, mid, r);
}
}
void Merge(vector<int>& nums, vector<int>& temp, int l, int mid, int r)
{
int i = l, j = mid + 1;
for (int k=l;k <= r;k++)
{
if (i > mid) {
temp[k] = nums[j++];
}
else if (j > r) {
temp[k] = nums[i++];
}
else if (nums[i] < nums[j]) {
temp[k] = nums[i++];
}
else
{
temp[k] = nums[j++];
}
}
for (int k=l;k<=r;k++)
{
nums[k] = temp[k];
}
}
};
快速排序
分割操作,单向调整
class Solution
{
public:
vector<int> sortArray(vector<int>& nums) {
QuickSort(nums, 0, nums.size()-1);
return nums;
}
void QuickSort(vector<int>& nums,int l,int r) {
if (l<r)
{
int mid = partition(nums, l, r);
QuickSort(nums, l, mid-1);
QuickSort(nums, mid + 1, r);
}
}
int partition(vector<int>& nums, int l, int r)
{
int pivot = nums[r];
int i = l, j = l,temp;
for (;j<r;j++)
{
if (nums[j] < pivot) {
temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
i++;
}
}
nums[r] = nums[i];
nums[i] = pivot;
return i;
}
};
分割操作,双向调整
class Solution {
public:
vector<int> sortArray(vector<int>& nums) {
QuickSort(nums, 0, nums.size() - 1);
return nums;
}
void QuickSort(vector<int>& nums, int l, int r) {
if (l < r)
{
int mid = partition(nums, l, r);
QuickSort(nums, l, mid - 1);
QuickSort(nums, mid + 1, r);
}
}
int partition(vector<int>& nums, int l, int r)
{
int pivot = nums[l];
int i = l + 1, j = r;
while (true)
{
while (i <= j && nums[i] <= pivot) i++;
while (i <= j && nums[j] >= pivot) j--;
if(i>j) break;
swap(nums[i], nums[j]);
}
swap(nums[j], nums[l]);
return j;
}
};
分割操作,双向调整,加入随机函数
class Solution {
public:
vector<int> sortArray(vector<int>& nums) {
QuickSort(nums, 0, nums.size() - 1);
return nums;
}
void QuickSort(vector<int>& nums, int l, int r) {
if (l < r)
{
int partition = randomPartition(nums, l, r);
QuickSort(nums, l, partition - 1);
QuickSort(nums, partition + 1, r);
}
}
int randomPartition(vector<int>& nums, int l, int r)
{
int i = (rand() % (r - l + 1)) + l;
swap(nums[i], nums[l]);
return partition(nums, l, r);
}
int partition(vector<int>& nums, int l, int r)
{
int pivot = nums[l];
int i = l + 1, j = r;
while (true)
{
while (i <= j && nums[i] <= pivot) i++;
while (i <= j && nums[j] >= pivot) j--;
if (i > j) break;
swap(nums[i], nums[j]);
}
swap(nums[j], nums[l]);
return j;
}
};