Derivatives, O-Notation

Related lectures (23)

Page 1 of 3

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

Provides an overview of essential search and sort algorithms in computer science.

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.

Explains recursive sorting using Merge Sort and its linearithmic complexity.

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Explores sorting methods, insertion sort, and algorithm comparison for efficient data organization.

Explores the Merge Sort algorithm, applying the Divide and Conquer approach to sorting arrays efficiently.

Explores optimization problems and greedy algorithms for efficient decision-making.