Lectures related to Aggregation Queries and Sorting

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

Explores examples of algorithm complexity, sorting, and polynomial computations.

Explores decision tree analysis for sorting algorithms and introduces the Counting Sort efficiency based on input structure.

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Explores the recursive version of insertion sort algorithm, emphasizing recursion and dynamic programming concepts.