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 vote317 views1 answer
Ex: cpp
C++
0 vote305 views1 answer
QT form doesn't take changes
C++
0 vote290 views1 answer
Setting a number of decimals on a float on C++
C++
2 votes312 views5 answers
C++ loop through array
C++
0 vote305 views1 answer
Use of strstr in c++
C++
1 vote323 views1 answer
Expected number of trials to get n consecutive heads
C++
22 votes293 views4 answers
Height of the tree
C++
-1 vote278 views1 answer
#include
C++
5 votes332 views3 answers
Float max value c++
C++
5 votes304 views1 answer
Screen record ios simulator
C++