Computer Science 385
Analysis of Algorithms

Spring 2011, Siena College

Home     Syllabus     Schedule

Agenda

• Announcements
• Exam 1 due
• Divide and conquer algorithms
  • Quicksort
  • Binary search
  • Binary trees
  • Strassen's algorithm
• Problem set 3 out

Lecture Assignment 12

Due at the start of class, Tuesday, March 1.

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 385 Lecture Assignment 12, Joe Student). We will discuss these questions at the start of class, so no late submissions are accepted.

1. Levitin Exercise 4.1.6, p. 128
2. Levitin Exercise 4.1.7, p. 128
3. Levitin Exercise 4.2.1, p. 134
4. Levitin Exercise 4.2.3, p. 134

Examples

• Quicksort at Sorting Algorithm Animations
• Strassen's Algorithm at Wikipedia.