Naive algorithm (Subset Sum The Subset-Sum Problem)

From Algorithm Wiki
Revision as of 10:52, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n * n)$ == Space Complexity == $O(n)$ auxiliary words (https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/321812.321823) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2}^n * n)$

Space Complexity

$O(n)$ auxiliary words

(https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/321812.321823)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Naive_algorithm_(Subset_Sum_The_Subset-Sum_Problem)&oldid=44853"