Considers how collections of information may be stored to allow
efficient searches
efficient traversals
Develops efficient in-memory sorting algorithms
to illustrate the principles of good design in algorithm development
to show how sorting is used to facilitate searching
Worst-case and average times are developed for
linear search
binary search
maximum entry sort
bubble sort
insertion sort
heapsort
quicksort
Illustrates the use of simulation in analyzing the execution time of a program
8.5: Quicksort: Another Fast Sort
8.6: Simulation of an Algorithm
8.7: Simulation Results for the Sorts
8.8: Synopsis of Search and Sort Efficiencies