CSSE 230: Session Notes - Day 27

Topics

1. Comparison of sorting algorithms
2. Average case of quicksort
3. Master theorem
4. File compression
5. Huffman encoding

Outline

• [5 min] Contact before work
• [15 min] Big-oh and big-array runtime comparisons of sorting algorithms seen in class.
• [15 min] Average case of quicksort
• [20 min] Solving recurrence relations through the master theorem
• [5 min] Break
• [20 min] File compression and huffman encoding
• [balance of time] Work on pair project.

Materials

• Runtime data on sorting algorithms seen in class.