Lecture
Optimization Algorithms: Greedy Approach
Related lectures (184)
Selection Sort: Implementation and Exercise
Explains the implementation of the selection sort algorithm and provides a detailed walkthrough.
Merge Sort: Divide and Conquer
Introduces growth of functions, sorting problem, insertion sort, computational model, and merge sort.
Binary Search Algorithm
Explores the binary search algorithm's efficiency in reducing search time.
Property-Based Testing: QuickChick
Explores property-based testing using QuickChick, focusing on software correctness, specifications, and dynamic information flow control.
Merge Sort: Divide-and-Conquer Approach
Introduces the merge sort algorithm through the divide-and-conquer approach, emphasizing correctness and time analysis.
Hashing and Quick Sort
Covers the efficient implementation of hash tables and the Quick Sort algorithm.
Geometric Realization in Model Categories
Explores geometric realization, simplicial sets, and model category structures.
Merge Sort: Divide and Conquer
Covers the merge sort algorithm, which recursively divides, sorts, and merges sublists to achieve a final sorted list.
Insertion Sort: Basics and Analysis
Introduces Insertion Sort, explaining its basics, insertion process, and correctness analysis.
Problem Solving Strategies: General Overview
Presents methods for problem-solving, emphasizing 'Divide and Conquer', recursion, and dynamic programming.