Hi,

I have a problem that I'm really stumped on. The problem is this:

Suppose that a[] is an array of integers of size 100, and that for each i
a. the element a[i] has value i
b. the element a[i] has value 99-i
If quicksort(a, a + 99) is invoked, how many function calls to quicksort() are made? Write your program which will test quicksort(), and compute and print the number of recursive calls to quicksort() for a. and b.

Can anyone help me figure this out/explain it to me?