Exam 8: Recursion

Suppose you are recursively searching an array filled with 512 items . If each subdivision returns two smaller arrays with n/2 items, how many smaller arrays are generated at the third level of the search?

The altered version of print_chars_reverse defined below will output the characters of the string argument in reverse order.

To test the binary search algorithm, you must test vectors with an even number of elements and vectors with an odd number of elements.

The iterative version of a function always requires significantly more memory that a recursive version.

The iterative and recursive algorithms used to compute a factorial value are O(__________), because the number of loop repetitions or recursive calls increases linearly with n.