上海交通大学交大密西根 联合学院· UM-SJTU Joint Institute University of Michigan Shanghal Jiao Tong University What? Most algorithmic strategies used to solve programming problems have counterparts out side the domain of computing.E.g,when you perform a task repeatedly, you are using iteration.When you make a decision,you exercise conditional control. Because these operations are familiar,most students learn to use the control statements for,while and if with relatively little trouble. However,you will have to learn to use a powerful problem-solving strategy that has few direct counterparts in the real world. That strategy is called recursion!What? • Most algorithmic strategies used to solve programming problems have counterparts out side the domain of computing. E.g, when you perform a task repeatedly, you are using iteration. When you make a decision, you exercise conditional control. • Because these operations are familiar, most students learn to use the control statements for, while and if with relatively little trouble. • However, you will have to learn to use a powerful problem-solving strategy that has few direct counterparts in the real world. • That strategy is called recursion!