TY - GEN
T1 - Loop invariants and mathematical games
AU - Ginat, David
N1 - Publisher Copyright:
© 1995 ACM.
PY - 1995/3/15
Y1 - 1995/3/15
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85030645190&partnerID=8YFLogxK
U2 - 10.1145/199688.199812
DO - 10.1145/199688.199812
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85030645190
T3 - Proceedings of the 26th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1995
SP - 263
EP - 267
BT - Proceedings of the 26th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1995
A2 - Miller, James E.
A2 - White, Curt M.
A2 - Gersting, Judy
A2 - White, Curt M.
PB - Association for Computing Machinery, Inc
T2 - 26th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1995
Y2 - 2 March 1995 through 4 March 1995
ER -