Concept
Pseudocode
Related lectures (10)
Algorithms: Finding Maximum Value in a Sequence
Covers finding the maximum value in a sequence of integers using different algorithm specifications and types.
Algorithms: Finding Maximum Value in a Sequence
Covers algorithm specification and finding maximum value in a sequence of integers.
Optimal Binary Search Trees
Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.
Longest Common Subsequence and Optimal BST
Explores Longest Common Subsequence and Optimal Binary Search Trees, discussing algorithms and probabilities for efficient search structures.
Matrix Multiplication: Strassen's Algorithm
Introduces matrix multiplication and Strassen's algorithm, covering divide-and-conquer approach, data structures like heaps, and MAX-HEAPIFY operation.
STL, Exceptions
Covers the STL in C++, smart pointers, and error management including exceptions and STL exception classes.
Code Generation Lab
Covers generating code for a compiler, translating an Amy program to WebAssembly, including memory management and pattern matching compilation.