Problem (10 points):
We just learnt about “greedy” computing method—trying to choose the best move in every step,
without regard to future options.
(a) What do you think is the necessary condition for the greedy computing method to find optimal solutions?
(b) How do you compare greedy computing method with recursive method (or divide-and-conquer)?
(c) Can you find other daily life computing problems where greedy method is good?
This is an awesome post that we can always come back to throughout the year!
ReplyDelete