ITM 207 Study Guide - Final Guide: The Item, Operand, Insertion Sort

• School: Ryerson University
• Department: Information Technology Management
• Course: ITM 207
• Professor: Henry Ojambo

Document Summary

The act of finding a solution to a perplexing, distressing, vexing, or unsettled question. How to solve it: a new aspect of mathematical method by george polya. How to solve it list written within the context of mathematical problems. Similar problems come up again and again. A good programmer recognizes problems that have been solved before and uses past solutions. Divide and conquer: break up a large problem into smaller units and solve each smaller problem. The divide-and-conquer approach can be applied over and over again until subtask is manageable. Analysis and specification phase: analyze, specification. Algorithm development phase: develop algorithm, test algorithm. Another arrow can be added if the problem is later revised. A set of unambiguous instructions for solving a problem or sub-problem in a finite amount of time using a finite amount of data. An algorithmic step in which all details are specified.