Reminder that you must complete the pre-reading before each class.

On this page:
✔️ Pre-reading for Tuesday 3/9
✔️ Pre-reading for Thursday 3/11

---

Pre-Reading for Quicksort, Tuesday 3/9

Essential Questions

Before attending class, please complete the material below and use the following questions to guide your note-taking:

✔️ How does the quicksort algorithm work?
✔️ What’s the time complexity of quicksort algorithm?

Read/Watch/Review

Before attending class, please complete the material below:

• Read Quick Sort Algorithm
• Watch Quick Sort, GeeksforGeeks (3 min)
• Watch Algorithms: Quick Sort (9 min)
  • Note that the implementation is in Java but the implementation in C++ would be very similar.
• Read Analysis of Quick Sort
• Watch The Quicksort Sorting Algorithm: Pick A Pivot, Partition, & Recurse (26 min)
  • Time complexity explanation starts @ 15 min mark

In Class

In today’s class we’ll be debugging broken implementations of quicksort.

---

Pre-Reading for Review, Thursday 3/11

Study for the exam (Tues 3/16) with these practice problem sets (PS1, PS2) and come to class with questions.

Once you’ve gone through the problem sets on your own, compare your answers with the solutions: PS1, PS2