Lectures related to Mail Distribution Process at EPFL

Maps: Key-Value Associations

Covers maps as key-value data structures, including querying, updating, and handling missing values, with practical examples like polynomial representation.

Recursive Sorting: Merge Sort

Covers the concept of Merge Sort, a highly efficient recursive sorting algorithm.

Python Programming: Sorting and Indexing

Covers Python programming concepts related to sorting and indexing.

Quick Sort: Divide-and-Conquer

Explores the Quick Sort algorithm, focusing on its divide-and-conquer approach and time complexity analysis.

Recursive Sorting: Merge Sort

Covers the concept of Merge Sort, a recursive sorting algorithm that divides a list into sublists until each sublist has one element.

Derivatives, O-Notation

Explores derivatives, O-Notation, extrema, and algorithm complexity in Analysis 1.

Hashing and Sorting Techniques in Database Systems

Provides an overview of hashing and sorting techniques in database management systems, focusing on their implementation and performance optimization.

Algorithms to Live By: Optimal Stopping and Logarithmic Regret

Explores optimal stopping, explore/exploit, Bayes' Rule, and logarithmic regret in bandit solutions.