Greedy vs Programación Dinámica | alg0.dev

Ir al contenido principal

/Conceptos/Greedy vs DP

1 / 8

Velocidad

/

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 algoritmos·by midudev

Greedy vs DP

Greedy

target = 8

coins:

1

4

6

Paso 1:Cambio de monedas: formar 8 con monedas [1, 4, 6] con el mínimo. Probemos Greedy primero.

Variables

target==8

coins==[1, 4, 6]

approach==Greedy