Quick Sort in C Program With Explanation

//quick sort in c program with explanation
#include<stdio.h>
void sort(int number[25],int first,int last)
{
int i, j, pivot, temp;
if(first<last){
pivot=first;
i=first;
j=last;
while(i<j)
{
while(number[i]<=number[pivot]&&i<last)
i++;
while(number[j]>number[pivot])
j--;
if(i<j)
{
temp=number[i];
number[i]=number[j];
number[j]=temp;
}
}
temp=number[pivot];
number[pivot]=number[j];
number[j]=temp;
sort(number,first,j-1);
sort(number,j+1,last);
}
}
int main()
{
int i, count, number[25];
printf("How Many Elements Do You Want");
scanf("%d",&count);
printf("Enter %d Elements", count);
for(i=0;i<count;i++)
scanf("%d",&number[i]);
sort(number,0,count-1);
printf("After sorting");
for(i=0;i<count;i++)
printf(" %d",number[i]);
return 0;
}