Using induction to design algorithms
Communications of the ACM
Foundations of computer science
Foundations of computer science
Teaching loop invariants to beginners by examples
SIGCSE '92 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
Teaching programming to liberal arts students: using loop invariants
SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
An axiomatic basis for computer programming
Communications of the ACM
The Science of Programming
A Discipline of Programming
Simulation game for teaching communications protocols
SIGCSE '97 Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
Teaching secure communication protocols using a game representation
ACE '03 Proceedings of the fifth Australasian conference on Computing education - Volume 20
| Hi-index | 0.00 |
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.