TI Basic would be next to worthless; it takes upwords of 8 seconds just to do a bubble sort on a 100 position long array. I can't imagine it being able to do an algorithm like that in a respectable amount of time.
TI Basic would be next to worthless; it takes upwords of 8 seconds just to do a bubble sort on a 100 position long array. I can't imagine it being able to do an algorithm like that in a respectable amount of time.
Well, it certinaly dosen't help that bubble sort is O(n^2)
The MD5 algorithm (assuming wikipedia has it right) looks simple enough, but is going to be slowed down immensly by the overhead of BASIC and the speed you can access memory (you do a "mini-MD5" for each 512-byte chunk of data).
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.