Algorithms and data structures

Related lectures (21)

Page 2 of 3

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Covers algorithms for searching, sorting, optimization, and the Halting Problem.

Covers the complexity analyses of search and sorting algorithms.

Explores binary search, merge sort, recursion in algorithms, Fibonacci numbers, and dynamic programming.

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Covers B+ Trees, a key data structure for efficient indexing in databases.

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

Covers the basics of algorithms, the importance of studying them, data structures, and the impact of algorithms on various fields.

Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.

Explores hashing techniques like static, extendible, and linear hashing, along with sorting methods such as external merge sort and B+ trees.