25 Aug
2003
25 Aug
'03
4:03 a.m.
hello
if you write yourself such a thing for a system with only one processor and a list longer than 1, it would be great. you should share this... :-)
have you tried quantic computing?
anyway, here is a solution doing the work for the first matching position of your number... it needs as many steps as the order of the first matching position.
jm
Hello again,
In our latest installment, our hero is trying to test if a number is in a list of numbers in one step. Can you think of a way of doing this? [sel] only tests one number and the list is variable length ( greater than or equal to 0 ) I suppose I could write myself an external but there has to be an easy way.
--
Jose Manuel Berenguer
jmbeal@telefonica.net +34932857046 +34696538403
jmberenguer@cccb.org +34933064128
http://212.163.142.140/jmb/index.html
http://sonoscop.cccb.org http://ocaos.cccb.org/caos
Sonoscop/Orquesta del Caos. CCCB. Montalegre, 5. 08001 Barcelona. Spain