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 vote116 views1 answer
C++ pwstr to char*
C++
0 vote103 views1 answer
Call function from separate bash script
C++
0 vote112 views1 answer
How the theam are store in database
C++
0 vote115 views1 answer
MPI_File_seek
C++
3 votes112 views3 answers
Find all occurrences of a substring in a string c++
C++
5 votes108 views2 answers
Time measurement c++
C++
8 votes119 views4 answers
C++ max and min of vector
C++
1 vote121 views1 answer
Modulo Exponentiaon,Iteratve Modulo Exponentiation
C++
1 vote105 views1 answer
How to iterate throguh a string in c++
C++
4 votes111 views1 answer
How to make i/o fast in c++
C++