一、选择排序
就是依次比较,每次选择最小的数放在前面
#include<iostream>
#include<vector>
using namespace std;
void Select_sort(vector<int> &v)
{
for (int i = 0; i < v.size(); i++) {
for (int j = i; j < v.size(); j++) { //就是依次比较,每次选择最小的数放在前面
if (v[i] > v[j]) {
int temp = v[j];
v[j] = v[i];
v[i] = temp;
}
}
}
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
int main()
{
vector<int> v = {36,23,12,52,63,1,3,9,72,3};
Bubble_sort(v);
return 0;
}
二、冒泡排序
将相邻两个数进行比较,交换顺序,每次将最大的数放在了末尾,所以后面的数就不需要再比较了,因此是j < v.size() - 1 - i;
#include<iostream>
#include<vector>
using namespace std;
void Bubble_sort(vector<int> &v)
{
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v.size()-1 - i; j++) { //将相邻两个数进行比较,交换顺序,每次将最大的数放在了末尾,所以
if (v[j+1] < v[j]) { //后面的数就不需要再比较了,因此是j < v.size() - 1 - i;
int temp = v[j];
v[j] = v[j+1];
v[j+1] = temp;
}
}
}
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
int main()
{
vector<int> v = {36,23,12,52,63,1,3,9,72,3};
Bubble_sort(v);
return 0;
}
三、快速排序
思路:二分查找的方法
#include<iostream>
#include<vector>
using namespace std;
void Quick_sort(vector<int> &v,int begin, int end)
{
int left = begin;
int right = end;
if (left >= right)
return;
int temp = v[begin];
v[begin] = v[(end - begin) / 2 + begin];
v[(end - begin) / 2 + begin] = temp;
int base = v[begin]; //将数组中间的那个数作为基准,防止有序数组出现最坏的情况
while (left < right) {
while (v[right] > base && left < right) { //由于base存放最左边的数,则v[begin]是个空位,可以利用
right--;
}
if (left < right) {
v[left] = v[right]; //利用这个空位存放数据
left++;
//right--; //这里不能减,这个位置是个空位,如果减了,就不是空位了
}
while (v[left] < base && left < right) {
left++;
}
if (left < right) {
v[right] = v[left];
right--;
//left++;
}
}
v[left] = base; //比较完之后,将base放进去
Quick_sort(v,begin,left-1);
Quick_sort(v, left+1, end);
}
int main()
{
vector<int> v = {36,23,12,52,63,1,3,9,72,3};
Quick_sort(v,0,v.size()-1);
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
return 0;
}
四、归并排序
基本思想:递归的将数组分为两个子数组,直到最后两个子数组内只有一个数字(有序的),然后有序的将子数组不断合并。
归并排序代码:(细节较多)
#include<iostream>
#include<vector>
using namespace std;
void Conbine_array(vector<int>& v1,int begin,int half,int end, vector<int>& v2)
{
int left = begin;
int right = half;
int i = 0;
while (left < half || right < end) { //0 0 1 56 32
if (left >= half) {
v2[i++] = v1[right++];
}
else if (right >= end ) {
v2[i++] = v1[left++];
}
else if (v1[left] > v1[right]) {
v2[i++] = v1[right++];
}
else {
v2[i++] = v1[left++];
}
}
int count = 0;
for (int j = begin; j < end; j++) { //更新v1数组使其[begin,end)变成有序部分
if (count <= i) {
v1[j] = v2[count++];
}
}
}
void Conbine_sort(vector<int> &v1, int begin, int end ,vector<int>& v2)
{
int half = (end - begin) / 2 + begin;
if (begin >= end)
return;
Conbine_sort(v1, begin, half, v2);
Conbine_sort(v1, half+1, end, v2); //注意:这里是half+1
Conbine_array(v1, begin, half + 1, end + 1, v2);//由于Conbine_array()是对[begin,half+1), [half+1, end)前开后闭进行
cout << "begin:" << begin << " " << "half:" << half << " " << "end:" << end << endl;
for (int j = 0; j < v1.size(); j++) {
cout << v1[j] << " ";
}
cout << endl;
}
int main()
{
vector<int> v1 = {56,32,5,9,12,44,32,5,66};
vector<int> v2(v1.size()); //工具数组
Conbine_sort(v1, 0, v1.size()-1, v2);
for (int j = 0; j < v2.size(); j++) {
cout << v2[j] << " ";
}
cout << endl;
return 0;
}