What is the time complexity of the greedy algorithm for the coin change problem?
O(n)
O(nlogn)
O(log n)
O(n^2)
This question is part of this quiz :