I made two TI-BASIC sorters last night. A bubble sorter and a recursive sorter. I will post the code later to see if anyone has optimizations. The bubble sort program sorts a list generated by rand(1,100,50) in about 43 seconds. The recursive sorter program sorts the same list in about 24 seconds. How is that for timing?

Hmmm, there was a golfing competition a while back where members had to create sorting algos. Of course, the SortA() and SortD() tokens were banned. I think some people had gotten down to a few seconds for 256 element lists, so your solution is definitely not the most optimal, but it is pretty good, given the fact that there were also entries that took multiple minutes. I remember being surprised at how difficult it was to implement an efficient sorting algo. Good job! I'd love to see the code you've come up with and maybe compare it to the entries to the golfing contest!

EDIT: I had posted my solution and Lirtosiast optimized it further. Here is the solution that came out of that:

Code:

Recursive Sort

Code:

Bubble sort

Code:


EDIT:

Wow! How does yours even work? What does For(B,B,sum(L1<=B do? It is quite the line of code!

Lol, i remember half attempting to participate in that contest, the attempts were burned in much fire (by me, because they were disgraceful)

Here, I annotated it. It isn't really any specific algo, but ressembles counting sort.

Code:

mr womp womp: Wow, I didn't realize you could do that! Did yours win?

This assumes that the range of numbers in the array will also be between 1 and 256.

Oldmud, indeed, that was a specification of the contest. A simple Dim() would generalize that right up, at the expense of some speed. And no, mine did not win.

Could I see the code from the winner?

Sure, this is the routine from lirtosiast, the input was in both L1 and Ans:

Code:


Source: https://www.cemetech.net/forum/viewtopic.php?t=12653

What is [recursiven]?

Here's my code to sort a list of 256 numbers known to be between 1 and 1000000 in 11 seconds. The range can be extended arbitrarily, but it won't be efficient if many elements are bunched up.

It's bucket sort followed by insertion sort. Still significantly slower than SortA( which takes only 3 seconds despite using the slower selection sort algorithm. That's the power of assembly—much less overhead.


Code:


By the way, [recursiven] is a variable in Seq mode that, like all system variables, is slightly faster to access than capital-letter variables, but like capital-letter variables can be used in For( loops.

The terminology [recursiven] is used by SourceCoder to differentiate between the lowercase letter 'n', and the functional n.

To get it on-calc, press the following buttons:
[2nd][0][log][enter]

It's also the token that the [x,τ,θ,n] button gives if the calculator's graphing mode is SEQ, or sequential.
To put your calculator in sequential mode, go to the catalogue and select it (for programs) by pressing these buttons (in this order):

[2nd][0][ln][↓][↓][↓][↓][↓][↓][↓][↓][↓][↓][enter] (press the down arrow 10 times)

or, to manually set it, press these buttons:
[mode][↓][↓][↓][→][→][→][enter]

The keys work on the CE, to learn more on sequential functions, click here.