13_SortedList - Data Structures and Algorithms I Sorted...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Click to edit Master subtitle style © 2009 Dr. Tim Data Structures and Algorithms I Sorted Lists Dr. Tim Margush University of Akron © 2009
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
© 2009 Dr. Tim Goals Be able to describe the basis for a sorted list ADT Know the tradeoffs for common implementations of a sorted list Understand how to implement a sorted list Be able to state and justify the relative efficiency of sorted list methods
Background image of page 2
© 2009 Dr. Tim List vs. SortedList Interface Elements
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
interface SortedListInterface This is similar to ListInterface Notably missing is insert at a given position and the ability to set an element at a given position public interface SortedListInterface <T extends Comparable<? Super T>> { boolean add(T newEntry); boolean remove(T anEntry); int getPosition(T anEntry); T getEntry(int givenPosition); //warning! }
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/22/2011 for the course CS 463 taught by Professor Dr. tim margush during the Fall '09 term at The University of Akron.

Page1 / 11

13_SortedList - Data Structures and Algorithms I Sorted...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online