Jan 21, 2015
MIT 6.00SC | Lecture 09 | Memory and Search Methods
Memory
When we have an list of int’s as shown below
L = [35, 4, 5, 29, 17, 58, 0]
The access to this list is always constant time, for a simple reason being the size of int is constant for a platform and a programming language.
To see how this constant time access works, lets consider ints occupy 4 units of memory, this units can be 8 bits, 16 bits. So how to access the ith element of the list…
View On WordPress