reorder a one dimensional, integer array from samllest to largest

/* reorder a one dimensional, integer array from samllest to largest
using pointer notation*/
#include
#include
#include
void reorder(int n, int *x);
void main()
{
int i,n,*x;
clrscr();
printf("How many numbers wil be entered?");
scanf("%d",&n);
x=(int*) malloc(n*sizeof(int));
for(i=0;in;++i) //insert less than sign
scanf("%d",x+i);
reorder(n,x);
for(i=0;in;i++) //less than sign
printf("%d\t",*(x+i));
getch();
}
void reorder(int n, int *x)
{
int i,item,temp;
for(item=0;item $n-1;++item)//insert less than sign instead of $
for(i=item+1;i$n;++i)//insert less than sign instead of $

if(*(x+i)<*(x+item))
{
temp=*(x+item);
*(x+item)=*(x+i);
*(x+i)=temp; }
}.