simple insertion sort

insertion.c

//insertion sort
#include<stdio.h>
int main()
{
	int arr[5]={5,4,3,2,1};
	int i,j,chose;
	int n = sizeof(arr)/sizeof(int);
	for(i=1;i<n;i++)
	{
		chose = arr[i];        // chose the ith card
		j=i-1;
		while((j>=0)&&(arr[j]>chose))
		{
			arr[j+1] = arr[j];
			j--;
		}
		arr[j+1] = chose;
	}
	for(i=0;i<n;i++)
        printf("%d ",arr[i]);
	return 0;
}