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 vote362 views1 answer
Madiar loh
C++
0 vote360 views1 answer
ViewController import
C++
2 votes356 views2 answers
What s[i]-'0' does
C++
0 vote299 views1 answer
Define type c++
C++
7 votes353 views3 answers
Read string with spaces in c++
C++
1 vote370 views1 answer
Unique_ptr header file
C++
2 votes335 views1 answer
Print a string with printf in c++
C++
1 vote325 views2 answers
Auto i cpp
C++
1 vote317 views10 answers
Js
C++
0 vote330 views1 answer
Unordered map c++
C++