Sorting and searching
By Timothy J. Purcell. 1995
• 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 CHAPTER GOALS O ne of the most common tasks in data processing is sorting. For example, a sequence of employees needs to be printed out in alphabetical order or sorted by salary. You will learn several sorting methods in this chapter and compare their performance. Once a sequence of records is sorted, one can rapidly locate individual records. You will study the binary search algorithm that carries out this fast lookup.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Miklos Santha
- Andrew M. Childs
- Vedran Dunjko
- Frédéric Magniez
- Salvador Elías Venegas-Andraca
- András Gilyén
Citations in the corpus
- Quantum Walk Based Search Algorithms (2008, background): “The corresponding literature is tremendous, most manuals on algorithms include several chapters that deal with searching procedures [22,14].”
- Oblivious RAM Revisited (2010, unknown): “See [3, 9, 20, 14] for details.”