Quick sort by C

quickSort.c

#include <stdio.h>
void quicksort(int a[],int first,int last)
{
    int temp,pviot,i,j;

    if (first<last)
    {
    pviot = first;
    i = first ;
    j = last;
        while (i<j){
            while (a[i]<=a[pviot] && i<last)
            i++;
            while (a[j]>a[pviot])
            j--;
            if (i<j){
            temp = a[i];
            a[i] = a[j];
            a[j] = temp;
            }
        }
    temp = a[pviot];
    a[pviot] = a [j];
    a[j] = temp;
    quicksort(a,first,j-1);
    quicksort(a,j+1,last);
    }
}

int main(){
  int x[20],size,i;

  printf("Enter size of the array: ");
  scanf("%d",&size);

  printf("Enter %d elements: ",size);
  for(i=0;i<size;i++)
    scanf("%d",&x[i]);

  quicksort(x,0,size-1);

  printf("Sorted elements: ");
  for(i=0;i<size;i++)
    printf(" %d",x[i]);

  return 0;
}