Quick sort in cpp

Quicksort.cpp

void swap(int* a, int* b) {
	int temp = *a;
	*a = *b;
	*b = temp;
}

int partition(int* arr, int low, int hi) {
	int pivot = arr[hi];

	int tempIdx = low - 1;

	for (int i = low; i < hi- 1; i++) {
		if (arr[i] <= pivot) {
			tempIdx = tempIdx + 1;
			swap(&arr[tempIdx], &arr[i]);
		}
	}
	swap(&arr[tempIdx + 1], &arr[hi]);

	return tempIdx + 1;
}

void quickSort(int* arr, int low, int hi) {

	if (low >= hi || low < 0) {
		return;
	}

	int p = partition(arr, low, hi);

	quickSort(arr, low, p - 1);
	quickSort(arr, p + 1, hi);
}

int main() {
	int arr[] = { 5, 7, 2, 3, 0, 9, -1 };

	quickSort(arr, 0, 6);

	for (int i = 0; i < 7; i++) {
		std::cout << arr[i] << " ";
	}
}