Lectures related to Solving Recurrences

Quick Sort: Divide-and-Conquer Log in to Mediaspace to watch this video

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

Merge Sort: Divide-and-Conquer Log in to Mediaspace to watch this video

Introduces Merge Sort, a divide-and-conquer algorithm for efficient array sorting, discussing correctness, runtime analysis, linear-time merging, and recurrence solving techniques.

Computation & Algorithms II: Sorting and Recursive Algorithms Log in to Mediaspace to watch this video

Explores sorting and recursive algorithms, including complexity analysis, maximal value, and binary search.

Derivatives, O-Notation Log in to Mediaspace to watch this video

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

Bayes Risk and Generalization in Machine Learning Log in to Mediaspace to watch this video

Explores Bayes risk, generalization, error rates, and interpolation methods in machine learning.

Quantum and nanocomputing: Exercise session 2 Log in to Mediaspace to watch this video

Covers quantum computing, nanocomputing, energy calculations, and computational complexity.