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 vote237 views1 answer
C++ get pointer from unique_ptr
C++
0 vote224 views1 answer
Log base 2 in c++
C++
0 vote170 views2 answers
See Compilation Time in c++ Program
C++
-1 vote191 views1 answer
Permutation c++
C++
11 votes197 views1 answer
Removing a character from a string in c++
C++
3 votes200 views1 answer
Vectors in c++
C++
0 vote194 views1 answer
Can you use rand to read in from an external file inc++
C++
0 vote208 views1 answer
Tuple vector c++
C++
0 vote212 views1 answer
C++ set element at index
C++
1 vote230 views1 answer
Qt window bottom bar
C++