15-122 Principles of Imperative Computation
Lecture 9: More Quicksort

• Reading: 08-qsort.pdf
• Code: qsort.c0, struct.c0, code directory
• Concepts:
  • The qsort function
  • Specifying partition
  • Average case complexity
  • Loop invariants
  • Contracts as pictures
  • Arrays, memory, and pointers
  • Homogeneous aggregates (arrays)
  • Heterogeneous aggregates (structs)
• Previous lecture: Quicksort
• Next lecture: Stacks and Queues

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

fp@cs
Frank Pfenning