Consider the recursive method given in Segment 7.21 that displays the contents of a chain of linked nodes in backward order. Also consider the recursive method described in Exercise 5 that displays the contents of an array in backward order.
a. What is the time complexity of each of these two methods, and how do they compare?
b. Write an iterative method that displays the contents of a chain of linked nodes in backward order. What is this method’s time complexity, and how does it compare to the complexities that you computed in Part a?
Exercise 5
Write a recursive method that writes a given array backward. Consider the last element of the array first.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.