Insertion sort
12345678910111213141516171819202122232425262728293031323334353637383940
#include <iostream>
#include <vector>
using namespace std;
void move(vector<int>& Arr, int start, int end){
int tmp = Arr[end];
for(int i = end; i > start; i--){
Arr[i] = Arr[i - 1];
}
Arr[start] = tmp;
}
void insertionSort(vector <int>& Arr){
for(int i = 0; i < Arr.size(); i ++){
if(Arr[i] < Arr[0]){
move(Arr, 0, i);//move to the begninning
}
else{
for(int j = 1; j < i; j++){
if(Arr[i] < Arr[j] && Arr[i] > Arr[j-1]){
move(Arr, j-1, i);
}
}
}
}//loop array and if the number is less than the first element, move it to the beginning
}
int main() {
vector <int> Arr {51, 65, 3, 658, 89, 1, 6, 8, 452, 87};
insertionSort(Arr);
for(int i = 0; i < Arr.size(); i ++){
cout << Arr[i] << endl;
}
return 0;
}
Cpp
INFO