Teaching the analysis of algorithms with visual proofs

8Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

We describe an approach for visually teaching important proofs in the Junior-Senior level course on the design and analysis of data structures and algorithms (CS7/DS&A). The main idea of this educational paradigm is to justify important claims about data structures and algorithms by using pictures that visualize proofs so clearly that the pictures can qualify as proofs themselves. The advantage of using this approach for DS&A is that it augments or even replaces inductive arguments that many students find difficult. Moreover, this paradigm communicates important algorithmic facts in a compelling way for students who are more visually-oriented. We illustrate this technique by giving examples of visual proofs of several key concepts in DS&A.

Cite

CITATION STYLE

APA

Goodrich, M. T., & Tamassia, R. (1998). Teaching the analysis of algorithms with visual proofs. SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education), 30(1), 207–211. https://doi.org/10.1145/274790.274298

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