Let's see, I see one little thing:
If θ=0
could be
!If θ

I'm not the best at optimizing for Axe, so I wouldn't doubt if more optimizations are out there.  Good luck!

That's weird.
I copied this from SourceCoder 2 over at Cemetech.

I found several, but before I post, could you explain what you're trying to do from start to finish?  It appears you're sorting a list first and then sorting another list the same way as the first one right after?  I know how to sort both at the same time if that's what your trying to do.  Can you give me an example of what input and output should be?

Also, how useful would a sort command be?  I was going to add it later, but maybe I can whip one up for the next version.  It would probably be SortA(ptr,size) to sort size bytes in the array at ptr or you can use an optional 3rd argument SortA(ptr,size,ptr2) to sort the data at the second pointer in the same order as the first.

It would probably use quicksort since it sorts in place, is simple and small to code, and computes in nlog(n) time.

SortA() and SortD() would be very useful!


Quigibo, basically, I'm trying to take values from the AppVar and throw them in a list. Then, I copy that list to another list and sort that one. Then, going down the list, it compares the values of the sorted list to the unsorted AppVar and assigns a number in ANOTHER list. It is this list that I need.

tl;dr - It produces a list of (Offset+1). The order of units in essence.

i would think the arguments would be SortA(addr,bytes) for an 8-bit val sort and SortA(addr,words)^r for 16-bit.
for consistency.
Edit: If no one has, someone should suggest it to quigibo on the Features Wishlist thread.

address of place to start sorting