Insertion Sort

#include<stdio.h>
void swap(int* a,int *b){
    int t = *a;
    *a = *b;
    *b = t;
}
int main()
{
	int n,i,k,j;
	printf("Enter the total number of students in class");
	scanf("%d",&n);int a[n];
	for(i=0;i<n;i++){
	    printf("Enter the height of student %d\n",i+1);
	    scanf("%d",&a[i]);
	}
	printf("Student's height order before sorting:\n");
	for(i=0;i<n;i++)
	printf("%d ",a[i]);
	for(i=0;i<n-1;i++){
	    for(j=i+1;j<n;j++){
	        if(a[i]>a[j]){
	            swap(&a[i],&a[j]);
	        }
	    }
	printf("\nHeight order of students after iteration %d\n",i+1);
	for(k=0;k<n;k++)
	printf("%d ",a[k]);
	}
	printf("After final comparison of all students, the height order becomes:\n");
	for(i=0;i<n;i++)
	printf("%d ",a[i]);
	return 0;
}