Sorting and Searching
Typical computer science students study the basic sorting algorithms at least three times before they graduate:first in introductory programming,then in data structures, and finally in their algorithms course.
KeywordsBinary Search Priority Queue Sorting Algorithm Binary Search Tree Partition Size
Unable to display preview. Download preview PDF.
- [KMS96]J. Komlos, Y. Ma, and E. Szemeredi. Matching nuts and bolts in o(n log n) time. In Proc. 7th Symp. Discrete Algorithms (SODA), pages 232–241, 1996.Google Scholar
- [Knu98]D. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading MA, second edition, 1998.Google Scholar
- [MU05]M. Mitzenmacher and E. Upfal. robability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.Google Scholar
- [Raw92]G. Rawlins. Compared to What? Computer Science Press, New York, 1992.Google Scholar