Little problem(s) July 2022

[Albert Chan]

(07-07-2022 12:02 PM)DavidM Wrote:  The varying size of the data elements in a type 29 (symbolic/exact) array give it a data structure very similar to a list, so GET is similarly constrained with those.

For elements of varying size, I would guess array just stored pointer. (like Python list)
In other words, array can lookup elements in O(1) time.

---

I think list really meant linked list.
Each cell stored pointer to element, and pointer to next cell.

Cells are not stored as continuous block in memory, thus cannot do O(1) lookup.
We have to walk the links, to get to elements, thus O(n) lookup