Object-Oriented Data Structures Using Java, 4th Edition

CHAPTER 11: Sorting and Searching Algorithms

Ake13bk/Shutterstock

Knowledge Goals

You should be able to

• describe the following sorting algorithms:

  • selection sort

  • bubble sort (two versions)

  • insertion sort

  • quick sort

  • merge sort

  • heap sort

• analyze the efficiency of the six sorting algorithms, in terms of time and space requirements

• discuss other sorting efficiency considerations: overhead, elimination of method calls, programmer time

• describe the concept of stability with respect to sorting algorithms

• describe and discuss the performance of the following search algorithms:

  • sequential search of an unsorted list

  • sequential search of a sorted list

  • binary search

  • searching a high-probability sorted list

Skill Goals

You should be able ...