bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Small typo fix

This commit is contained in:
Antti H S Laaksonen 2017-01-01 21:14:04 +02:00
parent 74cfe3bfe7
commit 30bb6699b5
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
luku05.tex
View File

@ -712,7 +712,7 @@ However, if the list remains the same but $x=10$,
it is not possible to form the sum. it is not possible to form the sum.
A standard solution for the problem is to A standard solution for the problem is to
go trough all subsets of the elements and go through all subsets of the elements and
check if the sum of any of the subsets is $x$. check if the sum of any of the subsets is $x$.
The time complexity of this solution is $O(2^n)$ The time complexity of this solution is $O(2^n)$
because there are $2^n$ possible subsets. because there are $2^n$ possible subsets.