Insertion Sort

insertionsort.cpp

#include <stdio.h>
int main()
{
	int A[20], n, k, i, loc, temp;
	A[0] = -32768;
	printf("Enter the number of elements: ");
	scanf("%d",&n);
	printf("\n Input %d Integers: ", n);

		for(i=1; i<=n; i++)
			scanf("%d", &A[i]);

			for(k=2; k<=n; k++)
			{
				temp = A[k];
				loc = k-1;

					while(temp < A[loc])
					{
						A[loc+1] = A[loc];
						loc--;
					}

					A[loc+1] = temp;
			}

			printf("\n\nSorted elements are : \n");

				for(i=1; i<=n; i++)
					printf("%d\t",A[i]);

	return 0;
}