this is for holding javascript data
Niclas Alexandersson edited c) Runtime bound.tex
almost 10 years ago
Commit id: 5cc529032589375c1c0a324276ac24b4780b882a
deletions | additions
diff --git a/c) Runtime bound.tex b/c) Runtime bound.tex
index 5226392..3312e06 100644
--- a/c) Runtime bound.tex
+++ b/c) Runtime bound.tex
...
\section{c) Runtime bound}
As we saw above, the algorithm takes exponential time as a function of the size of $k$, even if its behaviour can bee seen as polynomial with respect to the numeric value of $k$. These kinds of algorithms belong in a complexity class called \verb|pseudopolynomial complexity|.
