List Commands Library for 50g

[DavidM]

(08-13-2017 04:22 PM)Werner Wrote:  The RPL SORT routine uses binary insertion. Since insertion in this case is a stack roll, and that has been implemented very efficiently in machine language, you're going to have a hard time beating it using SysRPL only.
It (and my LSORT as well) actually covers Bruce's example, but it must be presented differently:

{ {7, "longest"} {6 "longer"} {4 "long"} }
SORT

returns

{ {4 "long"} {6 "longer"} {7, "longest"} }

Glad you saw this post, Werner. And also glad that John was already aware of your LSORT routine, which appears to be quite the speed demon. I have no desire to reinvent this wheel. I'm pretty certain that my Saturn code would be larger and slower than what you've already done anyway.

I wasn't aware that SORT (or LSORT) would handle a list of sublists in the way you've pointed out -- that's a nice way to achieve the desired results.

Combining the two lists:

Code:

{ "longest" "longer" "long" }
{ 7 6 4 }

into the needed format is simple enough with:

Code:

DUP SIZE LSDIV SWAP ADD

...which then leaves it to the user to choose which sort they want to use. After sorting, the combined list elements can be easily separated again if needed:

Code:

LCLLT 2 LSDIV LRLL EVAL