[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

On two algorithm design techniques

Published: 01 January 2018 Publication History

Abstract

The paper concerns two algorithm design techniques: reversing and designing by cases. Specific forms of these techniques are discussed and illustrated by examples from classic computer science (CS) algorithms, algorithmic puzzles, and games. The paper concludes with a discussion of the relationship between them and the accepted list of major algorithm design techniques. Based on this discussion, it suggests a realistic way reversing and designing by cases can be taught in the undergraduate CS curriculum.

References

[1]
Bell, J., Stevens, B. A survey of known results and research areas for n-queens, Discreet Mathematics, 309 (1), 1--31, 2009.
[2]
Bentley, J., Multidimensional divide-and-conquer, Communications of the ACM, 23 (4), 214--229, 1980.
[3]
Gardner, M., The Colossal Book of Short Puzzles and Problems, edited by Dana Richards, New York, NY: W.W. Norton, 2006.
[4]
Ginat, D., Colorful Challenges column, SIGCSE Bulletin, 38(2), 20--22, 2006.
[5]
Ginat, D., Armoni, M., Reversing: an essential heuristic in program and proof design, Proceedings of the 37th SIGCSE Technical Symposium on CS Education, 469--473, 2006.
[6]
Hess, D., All-Star Mathlete Puzzles, New York, NY: Sterling, 2009.
[7]
Knuth, D. E., Algorithmic thinking and mathematical thinking, American Mathematical Monthly, 92 (3), 170--181, 1985.
[8]
Levitin, A., Introduction to the Design and Analysis of Algorithms, 3rd edition, Pearson, 2012.
[9]
Levitin, A., and Levitin, M., Algorithmic Puzzles, New York, NY: Oxford University Press, 2011.
[10]
Nickerson, R. S., The Teaching of Thinking and Problem Solving. In R. J. Sternberg, ed., Thinking and Problem Solving, San Diego: Academic Press, 409--449, 1994.
[11]
Polya, G., How to Solve It: A New Aspect of Mathematical Method, 2nd edition, Princeton, NJ: Princeton University Press, 1957.
[12]
Polya, G., Mathematical Discovery: On Understanding, Learning, and Teaching Problem Solving, Volume 1, Wiley, 1962.
[13]
Rosen, K. H., Discrete Mathematics and Its Applications, 7th edition, New York, NY: McGraw-Hill, 2011.
[14]
Schuh, F., The Master Book of Mathematical Recreations, Mineola, NY: Dover, 1968.
[15]
Seidel, R. Backwards Analysis of Randomized Geometric Algorithms. In New Trends in Discrete and Computational Geometry, 37--67, 1993.
[16]
Wikipedia, Backward induction, https://en.wikipedia.org/wiki/Backward_induction, 2017, retrieved April 2, 2017.
[17]
Wing, J., Computational thinking, Communications of the ACM, 49 (3), 33--35, 2006.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Computing Sciences in Colleges
Journal of Computing Sciences in Colleges  Volume 33, Issue 3
January 2018
154 pages
ISSN:1937-4771
EISSN:1937-4763
Issue’s Table of Contents

Publisher

Consortium for Computing Sciences in Colleges

Evansville, IN, United States

Publication History

Published: 01 January 2018
Published in JCSC Volume 33, Issue 3

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 157
    Total Downloads
  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Dec 2024

Other Metrics

Citations

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media