Insertion_Sort

#include<stdio.h>

#include<stdlib.h>

#define MAX_SIZE 10

void insertion_sort(int *arr, int n);

int main(void){

int i,n;

int arr[MAX_SIZE];

n = MAX_SIZE;

for ( i=0; i<n ; i++) {

arr[i] = rand()%n;

printf("%d ",arr[i]);

}

printf("\n");

insertion_sort(arr,n);

for( i = 0; i<n; i++){

printf("%d\n", arr[i]);

}

return 0;

}

void insertion_sort(int *arr, int n){

int i, j, key;

for( i=1; i<n; i++){

key = arr[i];

for(j=i-1; j >= 0 && arr[j]>key ; j--){

arr[j+1] = arr[j];

printf("i = %d ,  arr[%d] = %d \n",i,j,arr[j]);

}

arr[j+1] = key;

}

}