Hi,

This is part of the QuickSort algorithmn I am trying to understand.

public static void sort(double[] a, int begin, int end){

if((end - begin) >= 1)

{

int splitPoint = split(a, begin, end);

sort(a, begin, splitPoint);

sort(a, splitPoint + 1, end);

}

}

How does the recursive call work in this case ? After getting a return value from split()

Does it execute sort(a, begin, splitPoint) until base case is met, then back track each stack ? then go to sort(a, splitPoint + 1, end) ?

Or does it do sort(a, begin, splitPoint) follow by sort(a, splitPoint + 1, end) until base case is met ?

Thanks