The following implementation of quicksort static void doquicksort(int array[ ], int start, int end) { int pivotpoint; pivotpoint = partition(array, start, end); doquicksort(array, pivot+1, end); doquicksort(array, start, pivot-1); }

The answer to this question is "To make too many recursive calls, the program will be terminated".

Explanation:

In the given code we define a function that is "doQuickSort". in the function parameter we pass three integer parameter that is "start, end and array[]" were start and end is variable and array is array[].  

we call this function to many times that's why it will be terminated.