C program to implement Quick Sort || with simple code

 // write a program in c to implement
 // Quick sort
 #include <stdio.h>
 #include<conio.h>
 void quicksort(int a[25], int first, int last)
 {
    int i, j, mid, temp;

    if (first < last)
    {
        mid = first;
        i = first;
        j = last;

        while (i < j)
        {
            while (a[i] <= a[mid] && i < last)
                i++;
            while (a[j] > a[mid])
                j--;
            if (i < j)
            {
                temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }

        temp = a[mid];
        a[mid] = a[j];
        a[j] = temp;
        quicksort(a, first, j - 1);
        quicksort(a, j + 1, last);
    }
  }
  int main()
  {
    int i, num, a[25];

    printf("Enter the size of elements:-\n ");
    scanf("%d", &num);

    printf("Enter %d element:-\n ", num);
    for (i = 0; i < num; i++)
    {
        scanf("%d", &a[i]);
    }
    quicksort(a, 0, num - 1);

    printf("Your Sorted elements is : ");
    for (i = 0; i < num; i++)
    {
        printf(" %d ", a[i]);
    }
    getch();
  }

When the above program is executed, it produces following results --

  Enter the size of elements:-
   6
  Enter 6 element:-
   9
  18
  -3
  420
  35
  333
  Your Sorted elements is :  -3  9  18  35  333  420