Loop invariants and mathematical games

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The concept of combining loop invariants with algorithm analysis and design is a significant programming tool. However, teaching this concept is not easy. One way of motivating and supporting the introduction of such a concept, is by illustrating it with attractive examples. In this paper we describe how to illustrate it with mathematical games. In our description, we emphasize the links between heuristic search strategies, pattern exploration, induction, and invariant construction.

Original languageEnglish
Title of host publicationProceedings of the 26th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1995
EditorsJames E. Miller, Curt M. White, Judy Gersting, Curt M. White
PublisherAssociation for Computing Machinery, Inc
Pages263-267
Number of pages5
ISBN (Electronic)089791693X, 9780897916936
DOIs
StatePublished - 15 Mar 1995
Externally publishedYes
Event26th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1995 - Nashville, United States
Duration: 2 Mar 19954 Mar 1995

Publication series

NameProceedings of the 26th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1995

Conference

Conference26th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1995
Country/TerritoryUnited States
CityNashville
Period2/03/954/03/95

Fingerprint

Dive into the research topics of 'Loop invariants and mathematical games'. Together they form a unique fingerprint.

Cite this