[Tutor] A faster x in S

[Dinesh B Vadhia]

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 using the is 'x in S' function.

I was wondering if there is anything faster?

Dinesh
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mail.python.org/pipermail/tutor/attachments/20080115/ceeee28e/attachment.htm