Greedy vs Dynamic Programming | alg0.dev

Skip to main content

/Concepts/Greedy vs DP

1 / 8

Speed

/

Big O Notation Recursion Two Pointers Sliding Window Space Complexity Memoization Greedy vs DP

Stack Queue Linked List Hash Table Binary Search Tree Heap

Bubble Sort Selection Sort Insertion Sort Quick Sort Merge Sort Heap Sort Counting Sort Radix Sort Shell Sort

Binary Search Linear Search Jump Search Interpolation Search

Breadth-First Search Depth-First Search Dijkstra's Algorithm Prim's Algorithm Topological Sort

Fibonacci DP Knapsack 0/1 Longest Common Subsequence

N-Queens Problem Sudoku Solver Maze Pathfinding

38 algorithms·by midudev

Greedy vs DP

Greedy

target = 8

coins:

1

4

6

Step 1:Coin Change: make 8 using coins [1, 4, 6] with fewest coins. Let's try Greedy first.

Variables

target==8

coins==[1, 4, 6]

approach==Greedy