Why does it say segmention fault : 11;

[IanZhang3374]

Write your question here.
Hi,
When I run this code it print segmention fault : 11 and does not print out he array. Here is my code:

  #include <iostream>

using namespace std;

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

int quickSort(int arr[], int size) {
	int pivot = arr[size - 1];
	int iCounter = 0;
	for(int jCounter = 1; jCounter < size - 1; jCounter++) {
		if(arr[jCounter] < pivot) {
				iCounter++;
				swap(arr[iCounter], arr[jCounter]);
		}
		if(jCounter == size - 2 && arr[jCounter] > pivot) {
				iCounter++;
				swap(pivot, iCounter);
				quickSort(arr, size);
		}
	}
	for(int counter = 0; counter < size - 1; counter++) {
		cout << "Sorted List :" << arr[counter];
	}
}

int main() {
	cout << "In this program I will do quick sort" << endl;
	cout << "The list will be 1, 8, 4" << endl;
	int arr[] = {0, 1, 8, 4};
	int size = sizeof(arr)/sizeof(arr[0]);
	quickSort(arr, size);
}

[ne555]

stack overflow, the problem is never reduced (line 23).

Also, ¿what's the meaning of `pivot'?
At line 13 it seems to be an element, but at line 22 you treat it as an index.

And you never consider the last element of the array, your loop stops too soon.

[IanZhang3374]

I am trying to do quick sort