Computer Science 120
Introduction to Programming
Fall 2011, Siena College
Lecture 24: Searching and Sorting
Date: Tuesday, April 26, 2011
Agenda
- Announcements
- Reminder: tomorrow's lab sessions treated as office hours
- Programming project 2 now due
- late penalty clock restarted at 9 AM
- time stamp in hw submit folders used for late penalty purposes
- you may hand in your printouts now
- demos may be done during tomorrow's lab sessions
- Final lab programs due last day of classes
- "Extra" lab programs will be accepted until Thursday, May 5.
- Final exam: Friday, May 6, 11 AM, Roger Bacon 250
- Reminder: do your course evaluations!
- A look back at Nibbles
- Searching and sorting
- linear search
- binary search
- selection sort
- insertion sort
Lecture Assignment 24
Due at the start of class, Thursday, April 28.
Please submit answers to these questions
either as a hard copy (typeset or handwritten are OK) or by email to
jteresco AT siena.edu by the start of class. Please use a clear subject line
when submitting by email (e.g., CS 120 Lecture
Assignment 24, Joe Student). We will discuss these
questions at the start of class, so no late submissions are
accepted.
- BDM Exercise 20.1.1, p.576. Consider the iterative
search only.
- BDM Exercise 20.1.4, p.581. Use the iterative binary
search algorithm in Figure 20.4.