List programming speed

Forum Attachments

Summary:

Are operations over lists actually faster?

List programming speed

VeryGoodDog 04 Jun 2019 13:35

I'm working on the Wikipedia page for TI-BASIC 83, I also happen to be in Georgia right now, on vacation. But, like a fool, I forgot to pack my calculators. I was wondering if the list operations are actually faster. I know you can add two lists or one scalar to a list, and a bunch of other stuff. I would like to do testing but I can't do tests without my calculators. I would greatly appreciate if someone wrote some code that tested a bunch, if not all, possible operations. If you do, I would love to see the code you used to test!

Thanks!

Re: List programming speed

lirtosiast 14 Jun 2019 21:35

Vectorized operations are several times faster than operations in loops. In a For( loop, you have to increment I, get the value of I, index lists, perform the operation, store into list elements, and store into Ans, totaling up to 10ms overhead per iteration. Vectorizing, you only have about 1ms overhead; when the operation takes 2ms this means about a 4x speedup.

Re: List programming speed

VeryGoodDog 02 Jul 2019 00:28

wicked, ill have to do a more in-depth look

Re: List programming speed

(account deleted) 02 Jul 2019 18:51

For which calculators? The speeds vary depending on the model, OS, and RAM/ROM availability. There is a speed difference between the TI-83/84/+/SE/CSE/CE/T/Premium CE

---

Hewwo, my name is Achak Claw. I was formerly BioHazard.