In one of the video lectures of module 4, I talked about a recursive function in C for implementing the quick sort algorithm.

[see code]

Below, you can find another example of recursive functions in C.

1. Try to guess the output of this program first.

2. Then, run it on ocelot and find out the real output.

3. Finally, justify your observation by explaining the way the recursive step and base cases of the recursive function "helper" works.

In one of the video lectures of module 4,1 talked about a recursive function in C for implementing the quick sort algorithm. Below, you can find another example of recursive functions in C. \#include char "helper(char 'str, int left, int right) f int len = right left +1 if ( len =0)// base case \#1 return ": if (len =1)(// base case 2 char " mv= (char ")malloc(2); strncpy(rv, str + left, 1): return N: I I/ recurisve step! char "first = helper(str, left, left + len / 2 - 1): char "second - helper(str, left + len / 2 , right): char "rv = (char ")malloc(len+1): strepy(riv, second): strcat(rv, first): return r; I char "unknown, operation(char "str) I int len = strien(str); return helper(str, 0, len - 1): int main(void) I char "out - unknown operation(" what does this function do?ly? print(" ( ssin", out): return o; 1. Try to guess the output of this program first. 2. Then, run it on ocelot and find out the real output. 3. Finally, justify your observation by explaining the way the recursive step and base cases of the recursive function "helper" works