Insertion Sort
12345678910111213141516171819202122232425262728293031323334
#include <iostream>
using namespace std;
void insertionSort(int A[], int n){
for (int i =1 ; i<n; i++){
int value = A[i];
int hole = i ;
while(hole >0 && A[hole-1]>value){
A[hole] = A[hole-1];
hole--;
}
A[hole] = value;
}
}
int main() {
int n;
cin>>n;
int A[n];
for(int i=0 ; i<n; i++ ){
cin>>A[i];
}
insertionSort(A,n);
for(int j=0 ; j<n; j++){
cout<<A[j]<<" ";
}
}
Cpp
INFO