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 vote120 views1 answer
Check if cin didn't get int
C++
-1 vote123 views1 answer
Sinonimo de tratar
C++
0 vote200 views1 answer
Virtual function c++
C++
0 vote143 views1 answer
_ZNSolsEi
C++
3 votes119 views1 answer
Friend function in c++
C++
9 votes114 views3 answers
How to iterate in string in c++
C++
17 votes137 views4 answers
Max element in vector c++
C++
23 votes156 views6 answers
Team fortress
C++
1 vote167 views3 answers
Print 2d vector c++
C++
0 vote111 views1 answer
How to create a min priority queue of pair of int, int
C++