شباب ارجوكم محتاج شرح Greedy Algorithm باللغة العربية

2. Consider the following problem:

in: array of positive numbers a0, a1, . . . , an−1

an integer M

out: subset of input numbers whose sum is maximal and M

• Assume that we use the following greedy algorithm to find this subset:

sum = 0

repeat

select the largest a_i such that sum + a_i <= M

until there is no such a_i left

Show that this greedy algorithm does not always find an optimal solution.

• Assume that we use the following greedy algorithm to find this subset:

sum = 0

repeat

select the smallest a_i such that sum + a_i <= M

until there is no such a_i left

Show that this greedy algorithm does not always find an optimal solution