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

1 vote291 views2 answers
Empty character constant error c++
C++
-2 votes256 views1 answer
English to french typing online
C++
1 vote303 views1 answer
Arduino Sring to const char
C++
1 vote277 views2 answers
How to print numbers with only 2 digits after decimal point in c++
C++
4 votes257 views1 answer
C++ get nth character in string
C++
0 vote280 views1 answer
Quicksort taking random pivot
C++
0 vote258 views1 answer
Why do men drink liquor
C++
3 votes294 views3 answers
C++ string contains
C++
0 vote296 views1 answer
C++ allocate and free dynamic 2d array
C++
1 vote255 views1 answer
Priority queue c++ type of pairs
C++