Implementation of Quick Sort in C++

quickSort.cpp

// We will call the function with quicksort(numbers, 1, numbers.length - 1)

int partition(int *numbers, int p, int r){
  int x = numbers[r];
  int i = p - 1;
  for (int j = p; j<r; j++) {
    if(numbers[j]<=x){
      i = i + 1;
      swap(numbers[i], numbers[j]);
    }
  }
  swap(numbers[i+1], numbers[r]);
  return i+1;
}

void quickSort(int *numbers,int p,int r){
  if(p<r){
    int q = partition(numbers, p, r);
    quickSort(numbers, p, q-1);
    quickSort(numbers, q+1, r);
  }
}