Lecture about Sorting algorithms
March 23, 2024
I gave this lecture to finalists of the Luxembourgish olympiad in informatics.
We first go over Big-Oh notation and how to compare the relative speed of different algorithms. Then we introduce comparison-based sorting algorithms and talk about quick sort, merge sort and heap sort in more detail. We then discuss counting sort as an example of an algorithm that is not comparison based.
Finally we go through a task about sorting from EGOI 2022.
You can find the slides here: Slides