> On 6 Aug 2018, at 1:57 pm, Brian Milby via use-livecode > <use-livecode@lists.runrev.com> wrote: > > Just tried that and it adds .7 sec (returning the unsorted keys). The sort > in the original takes around .7s. There are only 446 primes found at that > point. Returning an array is about the same time as returning an unsorted > R.
Hmm… could be the overhead of hashing the array keys. Would be interesting to see the results of just incrementing a counter rather than listing the primes. Cheers Monte _______________________________________________ use-livecode mailing list use-livecode@lists.runrev.com Please visit this url to subscribe, unsubscribe and manage your subscription preferences: http://lists.runrev.com/mailman/listinfo/use-livecode
