Lectures related to Las Vegas algorithm

Is a Q&A session covering algorithm correctness, rank functions, and message complexity in distributed systems.

Explores how randomness and recursion can be used to efficiently find the median of a list.

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

Factoring Polynomials: Complexity and Algorithms

Delves into the complexity of factoring polynomials and the implications for security.

Merge Sort: Sorting Algorithm

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

Quick Sort: Divide-and-Conquer

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