algorithm sorting 1st

#include<stdio.h>
int main()
{
    int a[6]={5,4,3,2,1,0};
    int n=6;
    int i,j;
    for (i=0; i<n; i++)
    {
        for (j=0; j<n-i; j++)
        {
            if (a[j]>a[j+1])
                {
                    int temp;
                    temp=a[j];
                    a[j]=a[j+1];
                    a[j+1]=temp;
                }
        }
    }
    printf("showing sorting order\n");
    for(i=0;i<n;i++)
    {
        printf("%d\n",a[i]);
    }
}