Reverse a list
bobsneidar at iotecdigital.com
Mon Feb 9 11:06:30 EST 2015
Then there is the method of storing the data in a memory based sqLite instance and using SELECT with the ORDER BY DESC ordering term. Might not be faster, but it should be a lot more flexible.
On Feb 8, 2015, at 14:37 , Alex Tweedly <alex at tweedly.net<mailto:alex at tweedly.net>> wrote:
Indeed. Jerry was (as usual) correct - if the engine can do it, then the engine will normally be faster.
BUT sorting a list requires moving the data around quite a lot, AND sorting something that actually reverses it can be a pathologically bad case (e.g. if the engine uses any variant of quicksort())..
More information about the Use-livecode