Lectures related to Counting sort

Covers the merge sort algorithm, which recursively divides, sorts, and merges sublists to achieve a final sorted list.

Explores Newton's laws of motion, fundamental forces in nature, and the unification of interactions.

Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications in computer science.

Explores convergence, numerical pathologies, and mesh convergence studies in finite element discretizations.

Covers the residue theorem, Cauchy's integral formula, and their applications in complex analysis.

Explores concrete examples of group actions on sets, focusing on actions that do not change the set.

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