Skip to main content
Book Chapter

Sorting and Searching

  • Skiena S
Springer London, (2012), 103-144
DOI: 10.1007/978-1-84800-070-4_4
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Skiena, S. S. (2012). Sorting and Searching. In The Algorithm Design Manual (pp. 103–144). Springer London. https://doi.org/10.1007/978-1-84800-070-4_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free