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
_______________________________________________ Tutor maillist - Tutor@python.org http://mail.python.org/mailman/listinfo/tutor
