Sorting and Searching

Chapter Goals

To compare the selection sort and merge sort algorithms
To study the linear search and binary search algorithms
To appreciate that algorithms for the same task can differ widely in performance
To understand the big-Oh notation
To learn how to estimate and compare the performance of algorithms
To learn how to measure the running time of a program.