This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 10/31/10 1 CS1110 2 November 2010 Developing array algorithms. Reading: 8.3..8.5 Haikus (5-7-5) seen on Japanese computer monitors Yesterday it worked. Today it is not working. Windows is like that. A crash reduces Your expensive computer To a simple stone. Three things are certain: Death, taxes, and lost data. Guess which has occurred? Serious error. All shortcuts have disappeared. Screen. Mind. Both are blank. The Web site you seek Cannot be located, but Countless more exist. Chaos reigns within. Refect, repent, and reboot. Order shall return. Important point: how we create the invariant, as a picture 1 Prelim next Tuesday, 7:30PM. Olin 155 and 255 Review session, Sunday 1–3. Phillips 101 Handout describes what will be covered. Quiz in class, Thursday, 4 October Memorize the 4 loopy questions and be able to tell whether a given loop satisFes them or not. Reason ¡or quiz: 1. You need to understand the 4 loopy questions in order to understand the array algorithms we will be developing. 2. You need to know about the 4 loopy questions ¡or the prelim 2 Developing algorithms on arrays We develop several important algorithms on arrays....
View Full Document
- Design by contract, formal methods, Generalization, loopy questions