Assignment 1

Written Assignment 1

Due Date: June 16, 2016 at the end of the class

Exercises

For this assignment you will follow these instructions:

• Review section 3.2, Standard notations and common functions
• Review the loop invariant proof for the MERGE procedure used in MergeSort (by the end of section 2.3.1 of the textbook)
• Problem 2-2 Correctness of bubblesort
• Problem 3-2 Relative asymptotic growths

The textbook:
Introduction to Algorithms
Cormen, Leiserson, Rivest, and Stein
Third Edition
The MIT Press