- TI-BASIC list sorter
- 26 Apr 2017 01:37:00 pm Permalink
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?