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 vote109 views1 answer
C++ list of pairs
C++
6 votes116 views1 answer
C++ create threads
C++
4 votes148 views3 answers
Clear screen in c++
C++
4 votes73 views2 answers
Poland
C++
2 votes114 views1 answer
C++ get file content
C++
0 vote126 views1 answer
Std::is_standard_layout
C++
1 vote102 views1 answer
What are specialized classes c++
C++
0 vote153 views5 answers
Palindrome String
C++
1 vote111 views1 answer
Have unique vector after sorting vector
C++
0 vote113 views2 answers
C++ compile to msi
C++