Sorting Strings

[Jacob Wall]

I have reviewed Didier Lachieze's code more in depth and I am very impressed with it, I have not come up with any way to improve it yet, unfortunately. I say unfortunately because on a real calculator a speed test on a list of 1000 items ran at ~30 seconds. On a virtual calculator on my PC it is closer to ~1 second.

One thing I tried was to replace the CAS sort with a custom QuickSort algorithm that uses the Comp function from Didier. The result is essentially exactly the same as CAS sort for time when tested with the 1000 element list.

Possible ways to improve speed:
- Reduce the number of times the Chunk() function is called. Ideally just once for each element in the list, but overhead to maintain the indices of separate lists has looked to be too expensive. May return to this idea because I have a hunch that roughly half the time might be consumed by the repeated Chunk() calls at each iteration of the sort.
- Other?