NotesFAQContact Us
Collection
Advanced
Search Tips
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Showing one result Save | Export
Peer reviewed Peer reviewed
Duncan, David R.; Litwiller, Bonnie H. – School Science and Mathematics, 1984
Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)
Descriptors: Algorithms, Classification, College Mathematics, High Schools