Brute Force (Change-Making Problem Change-Making Problem)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(S^n)$

Space Complexity

$O(n)$ words

(Easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

NA

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Brute_Force_(Change-Making_Problem_Change-Making_Problem)&oldid=44484"