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 vote132 views1 answer
How to traverse through vector pair
C++
1 vote112 views1 answer
Eosio check account exist
C++
0 vote96 views1 answer
Linux x11 copy paste event
C++
31 votes55 views1 answer
When to use struct vs class c++
C++
0 vote92 views1 answer
Infix to prefix using cpp linked list program
C++
-1 vote106 views2 answers
String stream in c++
C++
0 vote100 views7 answers
Online compiler to calculator time complexity
C++
0 vote96 views1 answer
Cout stack in c++
C++
0 vote97 views1 answer
Copying a set to vector in c++
C++
0 vote99 views1 answer
C++ thread wait fro 1 sec
C++