binary to decimal code optimization
im not trying for speed, im trying for size. right now, on my ti83+, this program takes up 37 ram (with a one letter program name, if that changes anything). is there any further optimization possible at this point?
(note: the code takes a binary number in a list (that list is Ans) and outputs the decimal equivalent. for example, 1012 is {1,0,1}.)
4ֿ¹sum(seq(Ans(1+dim(Ans)-A)2(2^A),A,1,dim(Ans