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 vote381 views1 answer
Ubuntu dotnet core install
C++
8 votes339 views4 answers
How to iterate through a map in c++
C++
8 votes360 views3 answers
C++ check substring
C++
1 vote424 views1 answer
How to make a parameter optional in c++
C++
0 vote327 views1 answer
Bool nullable to bool c#
C++
0 vote333 views1 answer
C++ suare
C++
1 vote357 views1 answer
Sfml mouse click
C++
0 vote340 views1 answer
Difference between --a and a-- c++
C++
-1 vote364 views1 answer
Fast way to check if a number is prime C++
C++
2 votes377 views1 answer
Null c++
C++