/* partition for quicksort */
#define SIZE 20
#include <stdio.h>

int a[SIZE] = {20, 19, 1, 3, 10, 10, 10, 10, 18, 4,
                5, 10, 6, 7, 10, 17, 16, 14, 15, 8};

void partition (int[], int left, int right, int pivotindex, int *i, int* j);

void display (int a[], int n)
{   int i;
    for (i=0; i<n; i++) printf ("%d ", a[i]);
    printf ("\n");
}

int main()
{  int i, j;
   display (a, SIZE);
   partition (a, 0, SIZE-1, 0, &i, &j);
   printf ("End first = %d, Start second = %d\n", j, i);
   display (a, SIZE);
   return 0;
}  /* end main */