15-122 Principles of Imperative Computation
Lecture 7: Sorting

• Reading: 07-sorting.pdf
• Code: qsort.c0, code directory
• Concepts:
  • Ephemeral and persistent data structures
  • Sorting algorithms
  • In-place sorting
  • Divide-and-conquer
  • Mergesort
  • Quicksort
  • Average case complexity
  • Randomization
  • The qsort function
  • Specifying partition
• Previous lecture: Binary Search
• Next lecture: Big O notation

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

jamiemmt@cs
Jamie Morgenstern