C++ code for insertion sort

#include<bits/stdc++.h>

using namespace std;

int main()
{
    //insertion sort
    int a[5] = {1,56,94,12,31};
    //if(n>1)
 int i,j;
 for(i=0;i<5-1;i++)
 {
     for(j=i+1;j>0;j--)
     {
         if(a[j]>=a[j-1])
         {
             break;
         }
         swap(a[j],a[j-1]);
     }
 }
 for(i=0;i<5;i++)
 {
     cout<<a[i]<<" ";
 }
 return 0;
}

Similar codes

-2 votes263 views4 answers
Function Template in c++
C++
19 votes160 views1 answer
C++ writing to file
C++
0 vote135 views2 answers
Sort using comparator anonymous function c++
C++
0 vote146 views1 answer
Clear qlayout
C++
4 votes200 views1 answer
Continue c++
C++
0 vote143 views1 answer
Powers of 2 in cpp
C++
1 vote145 views1 answer
Gestd::getline with wstring
C++
0 vote155 views1 answer
How to create a custom event in ue4 c++
C++
0 vote141 views1 answer
Rgb type def
C++
0 vote139 views1 answer
Arduino jumper programmieren
C++