Algorithms and data structures

Related lectures (21)

Page 1 of 3

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

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

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

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

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

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

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

Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.

Covers abstract data structures and the C++ standard library, including linked lists, stacks, queues, and complex numbers.

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.