Ongelma => problem
This commit is contained in:
parent
aef0b46254
commit
0203944cc2
|
@ -406,7 +406,7 @@ number such that the sum is $x$.
|
||||||
This can be done by performing $n$ binary searches,
|
This can be done by performing $n$ binary searches,
|
||||||
and each search takes $O(\log n)$ time.
|
and each search takes $O(\log n)$ time.
|
||||||
|
|
||||||
\index{3SUM-ongelma}
|
\index{3SUM-problem}
|
||||||
A somewhat more difficult problem is
|
A somewhat more difficult problem is
|
||||||
the \key{3SUM} problem where our task is
|
the \key{3SUM} problem where our task is
|
||||||
to find \emph{three} numbers whose sum is $x$.
|
to find \emph{three} numbers whose sum is $x$.
|
||||||
|
|
Loading…
Reference in New Issue