15-122 Principles of Imperative Computation
Lecture 8: Quicksort

  • Reading: none
  • Code: qsort.c0, code directory
  • Concepts:
    • Divide-and-conquer
    • Recursion
    • mergesort
    • quicksort
    • Random pivot selection
    • Worst-case complexity of quicksort
    • Average-case complexity of quicksort
    • Partioning
  • Previous lecture: Sorting
  • Next lecture: Queues

[ Home | Schedule | Assignments | Resources ]
[ Piazza | Blackboard ]

fp@cs
Frank Pfenning