+ 1
Activity selection
In greedy approach, activity selection is it necessary that we should enter the end time in ascending order. It is the basis of the algorithm or we can also sort it later.
1 Odpowiedź
+ 1
I think that if the array isn't sorted first, it will cause indexing problems.