CSSE 230: Session Notes - Day 27
Topics
Comparison of sorting algorithms
Average case of quicksort
Master theorem
File compression
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.