quicksort

quicksort.cpp

void quickSort(zaposlenici arr*, int left, int right)
 {
  int i = left, j = right;
  zaposlenici tmp;
  zaposlenici *pivot = arr[(left + right) / 2];

  /* partition */
  while (i <= j) {
        while (arr[i]->oib < pivot->oib)
              i++;
        while (arr[j]->oib > pivot->oib)
              j--;
        if (i <= j) {
              tmp = arr[i];
              arr[i] = arr[j];
              arr[j] = tmp;
              i++;
              j--;
    }
}
/* recursion */
if (left < j)
    quickSort(arr, left, j);
if (i < right)
        quickSort(arr, i, right);
}