Try this exercise. Click the correct answer from the options.
Which of the following statements are true?
Click the option that best answers the question.
- Greedy algorithms always return optimal result
- Greedy algorithms are efficient in terms of time and space
- Greedy algorithms can search for the shortest path in a graph, but there are no guarantees of finding it
- Both options 2 and 3
