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 vote153 views1 answer
C++ remove text file
C++
0 vote111 views1 answer
Map update field elixir
C++
-1 vote129 views1 answer
Socket programming in cpp
C++
0 vote122 views1 answer
C++ pointer to base class
C++
-1 vote119 views1 answer
Assigning a seed on a random number generator in C++
C++
5 votes136 views1 answer
Ue4 log float
C++
4 votes129 views1 answer
Get index of value c++
C++
0 vote143 views4 answers
How to make a square root function in c++ without stl
C++
2 votes135 views1 answer
String to wstring
C++
0 vote153 views1 answer
C++ rand include
C++