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 vote322 views1 answer
Remove decimal c++
C++
1 vote312 views1 answer
How to declare 1-D array in C/C++
C++
13 votes306 views3 answers
C++ remove last element from vector
C++
2 votes303 views1 answer
Split vector in half cpp
C++
21 votes307 views6 answers
Convert char to string c++
C++
7 votes351 views2 answers
Round c++
C++
0 vote295 views1 answer
C++ set value to inf
C++
0 vote326 views1 answer
Free pair c++
C++
0 vote338 views1 answer
Error: initialization with "{...}" expected for aggregate object - c++
C++
0 vote310 views1 answer
C++ convert int to double
C++