Use the function swap that you wrote in Exercise 2 to write a function that reverses the order of the items in a list a List.
Exercise 2:
Implement the function swap, as described in Checkpoint Question 3, but remove the assumption that the i th and jth items on the list exist. Return a value that indicates whether the swap was successful.
Question 3:
Write a pseudo code function swap(a List, i, j) that interchanges the items currently in positions i and j of a list. Define the function in terms of the ADT list operations, so that it is independent of any particular implementation of the list. Assume that the list, in fact, has items at positions i and j . What impact does this assumption have on your solution? (See Exercise 2 at the end of this chapter.)
Exercise 2:
Implement the function swap, as described in Checkpoint Question 3, but remove the assumption that the i th and jth items on the list exist. Return a value that indicates whether the swap was successful.