You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
23 lines
698 B
23 lines
698 B
---
|
|
comments: true
|
|
icon: material/head-heart-outline
|
|
---
|
|
|
|
# Chapter 15. Greedy
|
|
|
|
{ class="cover-image" }
|
|
|
|
!!! abstract
|
|
|
|
Sunflowers turn towards the sun, always seeking the greatest possible growth for themselves.
|
|
|
|
Greedy strategy guides to the best answer step by step through rounds of simple choices.
|
|
|
|
## Chapter contents
|
|
|
|
- [15.1 Greedy algorithms](greedy_algorithm.md)
|
|
- [15.2 Fractional knapsack problem](fractional_knapsack_problem.md)
|
|
- [15.3 Maximum capacity problem](max_capacity_problem.md)
|
|
- [15.4 Maximum product cutting problem](max_product_cutting_problem.md)
|
|
- [15.5 Summary](summary.md)
|