some guide
- From: "shokoohcpp@xxxxxxxxxxxxxx" <shokoohcpp@xxxxxxxxxxxxxx>
- Date: 5 Feb 2007 01:26:23 -0800
describe a theta (nlog n)-time algorithm that give a set of S of n
integers
and another integer x determine wether or not there exit two elements
in s whose sum is exactly x
.
- Follow-Ups:
- Re: some guide
- From: Timo Schneider
- Re: some guide
- From: rossum
- Re: some guide
- Prev by Date: Re: definition of statistical test for randomness
- Next by Date: Re: computer instruction (population count)
- Previous by thread: Re: DES
- Next by thread: Re: some guide
- Index(es):
Relevant Pages
|
|