Naive algorithm (Subset Sum The Subset-Sum Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O({2}^n * n)$ == Space Complexity == $O(n)$ auxiliary words (https://dl.acm.org/doi/10.1145/321812.321823) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$ words | ||
(https://dl.acm.org/doi/10.1145/321812.321823) | (https://dl.acm.org/doi/10.1145/321812.321823) | ||
Latest revision as of 09:44, 10 April 2023
Time Complexity
$O({2}^n * n)$
Space Complexity
$O(n)$ words
(https://dl.acm.org/doi/10.1145/321812.321823)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1940