On 2023-01-20 13:05, Alex Tweedly via use-livecode wrote:
We need a better algorithm. If we use a "linear scan", we can change
it from essentially Order(N**2) to approx Order(N).
Slightly pedantic point (I appreciate that you did say 'approx')...
Sorting can not be done in any less time than O(N*log N) - so the
revised algorithm is O(N*log N) as you have to sort the input for it to
be able to scan linearly.
:D
Warmest Regards,
Mark.
--
Mark Waddingham ~ m...@livecode.com ~ http://www.livecode.com/
LiveCode: Build Amazing Things
_______________________________________________
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
