Ascending and Descending order

#include <stdio.h>
#include <math.h>
main()
{
    int i,j,n[10],a[10],b[10],t,m;
    printf("\n\t Acending, Decending, Smallest, Biggest");
    printf("\n\t **************************************");
    printf("\n Enter the value : ");
    scanf("%d", &m);
    for(i=0; i<m; i++)
    {
        scanf("%d", &a[i]);
        printf("%d\n", a[i]);
        n[i] = a[i];
        b[i] = a[i];
    }
    for(i=0; i<m; i++)
    {
        for(j=i+1; j<m; j++)
        {
            if(a[i]>a[j])
            {
                t=a[i];
                a[i] = a[j];
                a[j] =t;
            }
        }
     }
     for(i=0; i<m; i++)
     {
        for(j=i+1; j<m; j++)
        {
            if(b[i]<b[j])
            {
                t = b[i];
                b[i] = b[j];
                b[j] =t;
            }
        }
     }
     printf("\n The given order \t Ascending order \t Descending order \n");
     for(i=0; i<m; i++)
     {
        printf("\n\t %d\t\t\t %d\t\t %d", n[i], a[i], b[i]);
     }
     printf("\n\n The smallest of given number is %d\n", a[0]);
     printf("\n\n The biggest of given number is %d\n", b[0]);
	 printf("\n\t\t***********************************\n");
	 getch();
}