mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-30 03:47:14 +00:00
build
This commit is contained in:
@@ -9,14 +9,14 @@ icon: material/head-heart-outline
|
||||
|
||||
!!! abstract
|
||||
|
||||
Sunflowers turn towards the sun, always seeking the greatest possible growth for themselves.
|
||||
Sunflowers turn toward the sun, constantly pursuing the maximum potential for their own growth.
|
||||
|
||||
Greedy strategy guides to the best answer step by step through rounds of simple choices.
|
||||
Through rounds of simple choices, greedy strategies gradually lead to the best answer.
|
||||
|
||||
## 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.1 Greedy Algorithm](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)
|
||||
|
||||
Reference in New Issue
Block a user