Eratosthenes. Other data structures, such as linked lists, sacrifice direct access to permit efficient inserts, deletes, or re-ordering of data. Self-balancing binary search trees may provide an acceptable compromise, where access time is not equal for all members of a collection, but the maximum time to retrieve a given member grows only logarithmically with its size. References See also Data stream Random-access machine Random-access memory although the cache and virtual memory make this no longer truly random access. Locality of reference Computer memory