Sort numeric array using simple sorting

This program sorts the array a[] using simple sorting method.In this method, two consecutive locations of the array are considered.The values are compared with each other and temp variable is used for swapping the values.

For eg,consider there are two values 14 and 10.14 is stored at location 0 and 10 is stored at location 1.Both the values are compared i.e. if( a[i] > a[j] ).Here i is 0 and j is 1.Since 14 is greater than 10,the value 14 is saved in temp variable i.e. t = a[i] .Then the value location 1 is copied to location 0 i.e. a[i] = a[j].In short,the value 10 is saved in location 0. Then the value stored in the temp variable is moved to location 1 i.e. a[j] = t. In short the value 14 is saved in location 1. In this way,the two values are compared and sorted.

#include < stdio.h >
#include < conio.h > 

void main()
{
	int a[20], i, n;

	clrscr();

	printf("\n C Language Program to implement a Simple Sort method on a Numeric Array \n");
	printf("\n Enter How Many Numbers [ i.e. Size of Array (n) ] : ");
	scanf("%d", &n);

	printf("\n Enter %d values \n",n);
	for(i = 0; i < n; i++)
		scanf("%d", &a[i]);

	printf("\n%d Values Before Sorting are \n",n);
	printf("\n");
	for(i = 0; i < n; i++)
		printf("%5d", a[i]);
	printf("\n");

	simple_sort(a,n);

	printf("\n%d Values After Sorting are \n",n);
	printf("\n");
	for(i = 0; i < n; i++)
		printf("%5d", a[i]);
	printf("\n");

} // main

int simple_sort(int a[], int n)
{
	int i, j, t;

	for(i = 0; i < n-1; i++)
	{
		for(j = i+1; j < n; j++)
		{
			if( a[i] > a[j] )
			{
				t = a[i];
				a[i] = a[j];
				a[j] = t;
			} // if
		} // for
	} // for
	return;
} // simple_sort