歸併排序
將數組分爲左右兩部分
將左右部分分別排好序(遞歸見代碼sortProcess函數)
建立輔助數組,將左右兩邊排好序的子數組按照大小放入輔助數組裏,然後將輔助數組拷貝到原數組中。見代碼merge函數
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
// 歸併排序
/*
* 1. 將數組分爲左右兩部分,左右邊分別排好序
* 2. 建立輔助數組,將左右兩邊排好序的子數組按照大小放入輔助數組裏
* 3. 將輔助數組拷貝到原數組中
* */
void merge(vector<int>& example, int left, int mid, int right) {
vector<int> tmp;
int p1 = left, p2 = mid + 1;
while (p1 <= mid && p2 <= right) {
if (example[p1] < example[p2]) {
tmp.push_back(example[p1]);
p1++;
} else {
tmp.push_back(example[p2]);
p2++;
}
}
while (p1 <= mid) {
for (int i = p1; i <= mid; i++) {
tmp.push_back(example[i]);
p1++;
}
}
while (p2 <= right) {
for (int i = p2; i <= right; i++) {
tmp.push_back(example[i]);
p2++;
}
}
for (int i = 0; i < tmp.size(); i++) {
example[left+i] = tmp[i];
}
}
void sortProcess(vector<int>& example, int left, int right) {
if (left == right) {
return;
}
int mid = left + ((right - left) >> 1);
sortProcess(example, left, mid);
sortProcess(example, mid + 1, right);
merge(example, left, mid, right);
}
void mergeSort(vector<int>& example) {
if (example.empty() || example.size() == 1) {
return;
}
sortProcess(example, 0, example.size() - 1);
}
};
int main()
{
vector<int> example = {1, 12, 9, 3, 6};
cout << "排序前的數組爲: ";
for (int i = 0; i < example.size() - 1; i++) {
cout << example[i] << ", ";
}
cout << example[example.size()-1] << endl;
cout << "----------------------------" << endl;
Solution su;
su.mergeSort(example);
cout << "排序後的數組爲: ";
for (int i = 0; i < example.size() - 1; i++) {
cout << example[i] << ", ";
}
cout << example[example.size()-1] << endl;
return 0;
}