4 void swap (int a[], int i, int j) {
6 t = a[i] ; a[i] = a[j] ; a[j] = t;
9 int partition (int a[], int l, int r) {
15 while (i <= r && a[i] <= pivot) ++i;
16 do --j; while (a[j] > pivot);
24 void quicksort (int a[], int l, int r) {
28 j = partition(a, l, r);
34 void print_tab (int tab[], int size) {
37 for (i = 0 ; i < size ; i++) {
44 int is_sorted (int tab[], int size) {
47 for (i = 0 ; i < size-1 ; i++) res = res && (tab[i] <= tab[i+1]);
53 int tab[SIZE] = {26, -21, 43, -62, 8};
55 quicksort(tab, 0, SIZE-1);
57 print_sint(is_sorted(tab, SIZE));
60 return (is_sorted(tab, SIZE));