On a program, I have a 62x94 matrix that gives me a memory error. That max number on the matrix will be 34, requiring only 4371 bytes. Is there any way to make this work? If there isn't, I could get the max down to 4, requiring only 3 bits per number. Being only 2185.5 bytes. Thanks!
Date: 14 Feb 2014 23:52
Number of posts: 6
RSS: New posts
Have you tried archiving all your other programs and clearing your RAM of unnecessary variables and lists and so forth?
Yeah. Did not work. How much bits does each point of a matrix normally use anyways?
My goal is too bring the bits per point of matrix down because I'll barely use them all. The max I'll ever use is 6 of them. Not sure how much there is though in a point of a matrix.
No, sadly, there is no way to do this, at least not one I've found.
In my current project program, I use a matrix for collision detection and to determine if you moved to a different area. They are quite useful, but take up lots of memory. It just depends on how you want to use them.
The TI-83+/84+ calculators store all numbers as floats. The format of TI floats is 1 byte for the type (this contains other information such as if the number is negative, or if it is part of a complex number), 1 byte for the exponent, which is only allowed to be on [-99,99], followed by 7 bytes of binary coded decimal (each digit uses 1 nibble, so 14 base 10 digits).
So each float uses 9 bytes. A complex number is 18. In a Real list, each element is 9 bytes, in a complex list, each element is 18 bytes. In a matrix, it can only have real elements and so each element is 9 bytes.
So to answer your question, each element takes 72 bits, but you can only realistically fit about 40 bits of data in each element.
47%? Take a look and try to imagine how cool 100% will be. This has won zContest 2011 and made news on TICalc. This compromise between Assembly and BASIC parses like BASIC and is fast like assembly. Grammer 2