Using the heapsort algorithm this program very quickly sorts a TI-list. For example, a 999 element list takes just 3 seconds to sort, compared to 55 seconds for the OS SortA( routine. **Update: Now only 200 bytes (compared to 357), faster, needs no additional RAM, and uses 15MHz mode if possible, so 999 elements takes about 1.1 seconds :)
- 2 years, 7 months ago
- No ratings.
ReviewsNobody has reviewed this file yet.
- ListSort (published 2 years, 7 months ago; 2020-04-05 22:14 UTC)