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

0 vote301 views1 answer
Count bit 1 c++
C++
6 votes350 views2 answers
How to print a decimal number upto 6 places of decimal in c++
C++
1 vote318 views1 answer
Std::stack
C++
0 vote310 views1 answer
Clear qlayout
C++
0 vote326 views1 answer
What is xor_eq c++
C++
60 votes445 views2 answers
For(var i=0; i<=10; i++)
C++
5 votes373 views6 answers
Binary search algorithm
C++
1 vote337 views1 answer
HOW TO TURN LINK TO BUTTON IN MVC
C++
16 votes356 views3 answers
Console clear c+
C++
19 votes317 views1 answer
Dev c++
C++