Okay, so I've got this recursive function.

Here's the prototype:

It takes as arguments an int array, a counter for the subscript (it's intiialized to 0 in main) and size, which is #DEFINE'd at 10 (the length of array b).Code:void someFunction( const int b[], int startIndex, int size );

Here's the function:

Okay. So I get recursive functions, and I know what the function does, it counts up through startIndex to get to the end of the array, then counts back down and outputs the array's values in reverse order. I get the count up, but I'm having trouble understanding why/how the countdown works.Code:void someFunction( const int b[], int startIndex, int size ) { if(startIndex < size) { someFunction(b, startIndex+1, size); printf("%d ", b[startIndex]); } } /* someFunction */

Thanks,

Colin