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

4 votes134 views6 answers
C++ length of char array
C++
1 vote169 views1 answer
Stack implementation using linked list in cpp
C++
0 vote142 views1 answer
Concatenate two vectors c++
C++
1 vote160 views1 answer
Login system with c++
C++
3 votes134 views2 answers
Fast Inverse Square Root
C++
1 vote130 views1 answer
Pass c++
C++
1 vote334 views1 answer
BAPS
C++
0 vote166 views1 answer
Check if cin got the wrong type
C++
0 vote131 views1 answer
C++ check that const char* has suffix
C++
0 vote133 views1 answer
Transpose function example in c++
C++