Lecture 12. Searching and Sorting, Part I

Sorting a data set is a common and important algorithmic task. Today we see how to use big-O notation to invent and then improve sorting algorithms.

Readings

• Readings: Chapter 10.1 - 10.2

Links

• Video on canvas
• Q&A

📦 Code and Slides

• Slides.pdf