im just doing

on the calc

my problem is that if i input a large amount of data, the commands will have to run through all of it every cycle. i wrote the algorithm to use lists to store data. if the list gets too big, it takes forever to run

if dim(list) = 999, and i do cumSum, mod, etc, it will have to run through each index in the list, which takes forever. on the other hand, if i break it up into blocks of 16 and operate on each of the blocks, it will run more times, but faster

is this really confusing?

my basic question is:

```
given a,b (integers ≥ 0, well, a might be 0, but b shouldn't be 0) and a string (str1) of arbitrary size, give me a way to
split the string up in a somewhat random way that will allow the program to run efficiently
f(a,b)→c
if i did the math right:
sub(str1,1,c
sub(str1,c+1,c
sub(str1,2c+1,c
etc.
```