insertionSort.cpp

#include <iostream>
using namespace std;

void insertionSort() {
int arr[] = {1,5,9,8,9,4,7,5,6,3,1,7};
int size=12;
int i,j;
          for (i = 1; i < size; i++)
    {
        for (j = i; j >= 1; j--)
        {
            if (arr[j] < arr[j-1])
            {
                arr[j] += arr[j-1];
				arr[j-1] = arr[j]  - arr[j-1];
				arr[j] -= arr[j-1];
            }
            else
                break;
        }
    }
      for (int i = 0; i < size; i++) {
          cout<<arr[i] <<((i==size-1)?"":" ,");
      }}


int main() {

insertionSort();


	return 0;
}