Random access

related topics
{math, number, function}
{system, computer, user}
{work, book, publish}
{god, call, give}
{album, band, music}

In computer science, random access (sometimes called direct access) is the ability to access an arbitrary element of a sequence in equal time. The opposite is sequential access, where a remote element takes longer time to access. A typical illustration of this distinction is to compare an ancient scroll (sequential; all material prior to the data needed must be unrolled) and the book (random: can be immediately flipped open to any random page. A more modern example is a cassette tape (sequential—you have to fast-forward through earlier songs to get to later ones) and a compact disc (random access—you can jump right to the track you want).

In data structures, random access implies the ability to access the Nth entry in a list of numbers in constant time. Very few data structures can guarantee this, other than arrays (and related structures like dynamic arrays). Random access is critical to many algorithms such as quicksort and binary search. Other data structures, such as linked lists, sacrifice random access to make for efficient inserts, deletes, or reordering of data.

See also

Full article ▸

related documents
Escape character
Name server
ABC (programming language)
Bit error ratio
Common Language Infrastructure
Filter (Unix)
Dia (software)
Data stream
Metcalfe's law
Grid network
Dining cryptographers protocol
Netwide Assembler
Longitudinal redundancy check
Andrew Tridgell
Common Language Runtime
Wikipedia:Federal Standard 1037C terms/telecommunications encryption terms
Common Intermediate Language
Wavelet compression
Typed link
Automatic data processing
Abbreviated Test Language for All Systems
Binary symmetric channel
Entropy encoding
Java remote method invocation