 | Chapter Objectives
(See related pages)
- Perform linear and binary search algorithms on arrays.
- Determine whether a linear or binary search is more effective for a given situation.
- Perform selection and bubble sort algorithms.
- Describe the heapsort algorithm and show how its performance is superior to that of the other two algorithms.
- Apply basic sorting algorithms to sort an array of objects, using the Comparator interface.
- Define the interface to specify common behavior and provide different versions of classes that implement the interface.
|
|