Question: Repeat the previous problem, but use knowledge of the size of the list to traverse from the end of the list that is closest to

Repeat the previous problem, but use knowledge of the size of the list to traverse from the end of the list that is closest to the desired index.


Previous problem

Suppose we want to extend the PositionalList interface to include a method, positionAtIndex(i), that returns the position of the element having index i (or throws an IndexOutOfBoundsException, if warranted). Show how to implement this method, using only existing methods of the PositionalList interface, by traversing the appropriate number of steps from the front of the list.

Step by Step Solution

3.59 Rating (149 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

We can implement the positionAtIndexi method using the following steps Create a variable count initi... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction to Algorithms Questions!