ITM 207 Lecture Notes - Lecture 7: The Algorithm, Pseudocode, List Of Fables Characters

• School: Ryerson University
• Department: Information Technology Management
• Course: ITM 207
• Professor: Youcef Derbal

Document Summary

*we can replace the word unknown with problem, data with information, and theorem with solution, and the list becomes applicable to all types of problems* (cid:0) part of problem solving. the second step is the main (cid:0) How will i recognize that i have found the solution? (cid:0) If you"ve solved the same or similar problem before, just repeat the successful solution. *in computing, you see certain problems again and again in different guises. *a good programmer sees a task, or perhaps part of a task (a subtask), that has been. You want the largest and smallest values in a set of numbers (cid:0) We break up a large problem into smaller pieces that we can solve individually. Tasks are divided into subtasks, which can be divided further into sub-sub tasks and so forth. The divide-and-conquer approach can be applied over and over again until each subtask is manageable.