Sorting Alorithms

insertion_sort

#include <iostream>

using namespace std;

void swap(int *a, int* b)
{
  int tmp = *a;
  *a = *b;
  *b = tmp;
}

void selection_sort( int a [], int size)
{
 // First check if the element is smaller than previous ones
 for (int i =1; i<size;++i)
  {
    for(int j=i; j>=0 ; --j)
    {
       if(a[j]< a[j-1])
       {
        swap(&a[j],&a[j-1]);
       }
    }
  }

}

void printArray(int a[], int size)
{
 for(int i=0; i<size; ++i)
 {
  cout<<a[i]<<":";
 }
 cout<<endl;
}

int main()
{
int arr[] = {9,4,5,10,27,1,9};
printArray(arr,7);
selection_sort(arr,7);
printArray(arr,7);
}