Stacks and Queues: Implementation and Efficiency

Related lectures (21)

Page 2 of 3

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

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

Explores algorithm complexity, big-O notation, induction, recursion, and analysis of running times, covering NP problems and complexity classes.

Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.

Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.

Introduces greedy algorithms and matroids, highlighting their efficiency in solving optimization problems.

Covers the implementation and manipulation of dynamic arrays in C++ using vectors, focusing on their features and performance implications.

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Covers the analysis of worst time complexity for algorithms and time complexity with real numbers and integers.

Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.