faster x in S
Dinesh B Vadhia wrote:
> For some significant data pre-processing we have to perform the
> following simple process:
>
> Is the integer x in a list of 13K sorted integers. That's it except
> this has to be done >100m times with different x's (multiple
Kent and Bob,
Are you thinking of the first problem in Bentley's Programming Pearls?
The original poster's questions sounds like it could be in that domain.
http://netlib.bell-labs.com/cm/cs/pearls/cto.html
So I agree: the next questions we probably should ask the original poster:
* W
Dinesh B Vadhia wrote:
> For some significant data pre-processing we have to perform the
> following simple process:
>
> Is the integer x in a list of 13K sorted integers. That's it except
> this has to be done >100m times with different x's (multiple times).
> Yep, a real pain!
>
> I've
Dinesh B Vadhia wrote:
> For some significant data pre-processing we have to perform the
> following simple process:
>
> Is the integer x in a list of 13K sorted integers. That's it except
> this has to be done >100m times with different x's (multiple times).
> Yep, a real pain!
>
> I've
For some significant data pre-processing we have to perform the following
simple process:
Is the integer x in a list of 13K sorted integers. That's it except this has
to be done >100m times with different x's (multiple times). Yep, a real pain!
I've put the 13K integers in a list S and am u
