| Sequential Access |
Article Index for Sequential |
Shopping Sequential |
Website Links For Access |
Information AboutSequential Access |
| CATEGORIES ABOUT SEQUENTIAL ACCESS | |
| computer data | |
| data structures | |
|
In Data Structure s, a data structure is said to have Sequential Access if one can only visit the values it contains in one particular order. The canonical example is the Linked List . Indexing into a list which has sequential access requires O(''k'') time, where ''k'' is the index. As a result, many algorithms such as Quicksort and Binary Search degenerate into bad algorithms that are even less efficient than their naïve alternatives; these algorithms are impractical without Random Access . On the other hand, some algorithms, typically those which don't perform indexing, require only sequential access, such as Mergesort , and so face no penalty. See also Random Access and Direct Access . |
|
|