Beynon, Rob wrote:
Dick Kriesel not only suggested trying arrays but wrote some code to
test this.
The least I could do was try it.
Thanks for taking the time, I really was curious.
Hit a bug on first pass, but Dick, the filtering (searching) section
took 248seconds, or 4min 13 sec. So, I guess the speed gain is once
again modest. Does this mean that Rev is really efficient, almost
irrespective of the strategy used in the program?
Rev is extremely efficient and even the slow stuff is usually pretty
fast. In this case it doesn't seem to matter, but there are other times
where you'll notice a dramatic difference depending on the algorithm.
Anyway, this one was enlightening.
--
Jacqueline Landman Gay | [EMAIL PROTECTED]
HyperActive Software | http://www.hyperactivesw.com
_______________________________________________
use-revolution mailing list
[email protected]
Please visit this url to subscribe, unsubscribe and manage your subscription
preferences:
http://lists.runrev.com/mailman/listinfo/use-revolution
