 |
Random access is a feature of certain data structures where the lookup time for any item is constant. The opposite to random access is sequential access. The trade off for Random access is increased storage requirements.
|
This article is a stub. You can help Programmer's Wiki by expanding it.
Remember to remove this when the stub is fixed. |
Random access is a feature of certain data structures where the lookup time for any item is constant. The opposite to random access is sequential access. The trade off for Random access is increased storage requirements.