Lectures related to Best, worst and average case

Explores solving linear systems iteratively and compares different solvers based on worst-case assumptions and convergence measures.

Covers the complexity analyses of search and sorting algorithms.

Covers heaps, heapsort, heap data structure, storage in arrays, and heap property maintenance.

Explains errors in correlated and uncorrelated sampling, correlation function, time, and blocking analysis.

Explains recursive sorting using Merge Sort and its linearithmic complexity.