Sorter

SORTER


by Alan Gibson





[The routine doesn't check for zero values, so I had to change the]


[demo slightly to avoid these. JimG]





Providing a short but much needed break from the omnipresent Swann is


Alan Gibson, with a short routine which simply sorts out a table of


values (each with an identity number) from highest to lowest. Erm ...


and that's about it. You can stick the routine anywhere in memory, but


it always reads from the same addresses. That is, 65000 to 65029 must


contain the values to be sorted, 65030 must hold the maximum possible


value, and 65040 onwards get used by the program so as to return the


identity numbers in order. Could be useful for writing a footy manager


game or something - Alan's demo is certainly this way orientated. See


what you think.