Using O(n) ProxmapSort and O(1) ProxmapSearch to motivate CS2 students, Part II

Authors:
Thomas A. Standish;Norman Jacobson
Affiliations:
University of California, Irvine, Irvine, California;University of California, Irvine, Irvine, California
Venue:
ACM SIGCSE Bulletin
Year:
2006

Citing 2
Cited 0

Data Structures in Java

Data Structures in Java
Data Structures, Algorithms, & Software Principles in C

Data Structures, Algorithms, & Software Principles in C

Quantified Score

Hi-index	0.00

Visualization

Abstract

Presenting "cool" algorithms to CS2 students helps convince them that the study of data structures and algorithms is worthwhile. An algorithm is perceived as cool if it is easy to understand, very fast on large data sets, uses memory judiciously and has a straightforward, short proof --- or at least a convincing proof sketch --- using accessible mathematics. To illustrate, we discuss two related and relatively unknown algorithms: ProxmapSort, previously discussed in Part I of this paper, and ProxmapSearch, discussed here.