Quick Sort in C++

QuickSort

static void Swap(int& x, int& y) {
		int swap = x;
		x = y;
		y = swap;
	}
  
static int Partition(int arr[], int minIndex, int maxIndex) {
		int pivot = arr[maxIndex];
		int i = minIndex - 1;

		for (int j = minIndex; j < maxIndex; j++) {
			if (arr[j] < pivot) {
				i++;
				Swap(arr[i], arr[j]);
			}
		}

		pivot++;
		Swap(arr[i+1], arr[maxIndex]);
		return i+1;
	}
  
static void QuickSort(int arr[], int minIndex, int maxIndex) {
		if (minIndex < maxIndex) {
			int pivotIndex = Partition(arr, minIndex, maxIndex);
			QuickSort(arr, minIndex, pivotIndex - 1);
			QuickSort(arr, pivotIndex + 1, maxIndex);
		}
	}