Lecture 33

Learning objectives

After this class, you should be able to:

1. Given data to be sorted, show the data after each step of (i) bubble sort and (ii) insertion sort.
2. Derive the time complexity for bubble sort and insertion sort.
3. If the data is almost sorted, then explain which sorting algorithm would be better, bubble sort or insertion sort.
4. Derive a lower bound on simple sorting algorithms.

Reading assignment

1. Section 7, sections 7.2, 7.3.
2. Lecture: Sorting.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Show the steps involved in sorting the following data using (i) bubble sort and (ii) insertion sort: 16 14 10 8 7 9 3 2 4 1.
  2. Improve the best case time for bubble sort by first checking if the data is already sorted, in O(n) time. If the data is almost sorted, then does this modification help?

• Questions on next lecture's material
  1. None.

---

Last modified: 22 Nov 2011