18 juillet 20193 août 2020 Patrick Meyer Which statements best describe a greedy algorithm? It is an algorithm that follows locally optimal solutions. It is an algorithm that operates on graphs only. It is an algorithm that has very limited complexity. Which of the following statements are true? A greedy algorithm is in all cases not optimal. For some problems, a greedy algorithm can be non-optimal. There is only one greedy algorithm to solve a given problem. Time is Up!
