选择排序
选择排序是指 每次将最大值或者最小值放在最前面 时间复杂度为O(n^2)
#include<iostream>
#include<vector>
using namespace std;
void swap(vector<int> &arr,int i,int j){
int tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
int main(){
vector<int> arr = {1,23,2,45,6,5,76,8};
for(int num:arr){
cout<<num<<" ";
}
cout<<endl;
for(int i=0;i<arr.size();i++){
//每轮循环
int min = i;
for(int j=i;j<arr.size();j++){
if(arr[min]<=arr[j]){
min = j;//遇见小值九交换下标
}
}
swap(arr,i,min);//交换值的位置
}
for(int num:arr){
cout<<num<<" ";
}
return 0;
}
冒泡排序
将大值往后放 时间复杂度为O(N^2)
#include<iostream>
#include<vector>
using namespace std;
void swap(vector<int> &arr,int i,int j){
//0^N = 0;N^N = 0;A^B = B^A;A^B^C = (A^B)^C
arr[i] = arr[i]^arr[j];
arr[j] = arr[i]^arr[j];
arr[i] = arr[i]^arr[j];
}
int main(){
vector<int> arr = {1,23,4,5,6,3,2,1,3,5};
for (int num:arr){
cout<<num<<" ";
}
cout<<endl;
for(int i = arr.size()-1;i>=0;i--)
{
for(int j=0;j<i;j++){
if(arr[j]>arr[j+1])
{
swap(arr,j,j+1) ;//相邻值比较大的往后放
}
}
}
for(int num:arr){
cout<<num<<" ";
}
cout<<endl;
return 0;
}
插入排序
插入排序是将值与前几个数依次比较,小的就往前面放,时间复杂度依据序列的顺序,有序为O(N)的复杂度,无序则为O(N^2)
#include<iostream>
#include<vector>
using namespace std;
void swap(vector<int> &arr,int i,int j){
arr[i] = arr[i]^arr[j];
arr[j] = arr[i]^arr[j];
arr[i] = arr[i]^arr[j];
}
int main(){
vector<int> arr = {2,31,4,1,2,3,41,5};
for (int i=1;i<=arr.size();i++){
for(int j=i-1;j>=0;j--){
if(arr[j]<arr[j-1]){
swap(arr,j,j-1);
}else{
break;
}
}
}
for(int num:arr){
cout<<num<<" ";
}
cout<<endl;
return 0;
}