CS341 Study Guide - Oa, Heapsort, Binary Search Algorithm
Document Summary
These are notes for sections 1 and 3; section 2 may differ somewhat. Prof. shallit passed out 3 x 5 cards, and asked everyone to write their name, nickname, e-mail address (optional), and one interesting thing about them. If you did not hand in such a card, please see him to obtain one. Course administration details (most of which can be found here). The first assignment is available (due september 16). Here are the things we assume you already know well from cs 240 and other courses. All of these topics are covered in the 341 course textbook. Reading for this lecture: clrs, sections 2. 1-2. 3. (from now on, clr or clrs refers to the course textbook. ) A series of computational steps intended to solve a problem. Design: what are some techniques to build algorithms to solve problems? (e. g. , greedy algorithm, dynamic programming, divide-and-conquer)
