COP 4531: Lecture 2

Learning objectives

After this class, you should be able to:

1. Given an array, show the steps executed by INSERTION-SORT.
2. Prove the correctness of insertion sort, using loop invariants.
3. Write code to implement insertion sort.
4. Give the asymptotic time complexity of insertion sort.
5. Given an algorithm similar to insertion sort, prove its correctness and determine its time complexity.

Reading assignment

1. CLR: Sections 2.1 - 2.2, prepare for the test on pre-requisite materials.
2. CLR: Chapter 2, pages 29 - 31.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 2.1-1.
  2. Exercise 2.1-3.
  3. Exercise 2.2-2.

• Questions on next lecture's material
  1. Let an array A contain the elements: 3, 26, 41, 52, 9, 38, 49, 57. Show the steps taken by the procedure MERGE operating on A with p = 1, q = 4, r = 8.