15-122 Principles of Imperative Computation
Lecture 8: Quicksort

• Reading: 08-qsort.pdf
• Code: qsort.c0, code directory
• Concepts:
  • Partitioning for quicksort
  • Loop invariants
  • Arrays and memory
  • Homogeneous aggregates (arrays)
  • Heterogeneous aggregates (structs)
• Previous lecture: Sorting
• Next lecture: Queues

[ Home | Schedule | Assignments | Resources ]
[ Blackboard | academic.cs.15-122 ]

fp@cs
Frank Pfenning