Information AboutRandom Access |
| CATEGORIES ABOUT RANDOM ACCESS | |
| computer data | |
|
In Data Structure s, random access implies the ability to access the ''k''th entry in a list of numbers in constant time. Very few data structures can guarantee this, other than Array s. Random access is critical to many algorithms such as Quicksort and Binary Search . Other data structures, such as Linked List s, sacrifice random access to make for efficient inserts, deletes, or searches. It is also the name of a gadget review site: RandomlyAccessed.com . |
|
|