Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn widely used algorithms
·
Module 4
Greedy and Divide & Conquer Strategies
1
Divide and Conquer: Problem Identification and Recursive Structure
Identify problems amenable to divide and conquer and outline their recursive structure.
2
Divide and Conquer: Closest Pair of Points
Apply the divide and conquer strategy to solve a problem like the closest pair of points.
3
Greedy Choice and Optimal Substructure
Identify the greedy choice property and optimal substructure in a problem.
4
Activity Selection: A Greedy Approach
Apply a greedy strategy to solve the activity selection problem.
Huffman Coding: A Greedy Approach
Analyze Huffman coding as an application of a greedy algorithm.
Previous module
Core Sorting and Searching Algorithms
Next module
Graph Traversal Techniques