- 업종: Technology
- Number of terms: 2742
- Number of blossaries: 0
- Company Profile:
The National Institute of Standards and Technology (NIST) — known between 1901 and 1988 as the National Bureau of Standards (NBS) — is a measurement standards laboratory and a non-regulatory agency of the United States Department of Commerce. The institute's official mission is to promote U.S. ...
A variant of a linked list in which each item has a link to the previous item as well as the next. This allows easily accessing list items backward as well as forward and deleting any item in constant time.
Industry:Computer science
A variant of a linked list in which the nominal tail is linked to the head. The entire list may be accessed starting at any item and following links until one comes to the starting item again.
Industry:Computer science
A variant of a threaded tree in which only the right thread, i.e. link to the successor, of each node is maintained.
Industry:Computer science
A variant of a trie in which leaf nodes are buckets which hold up to k strings. Usually implies fixed sized buckets.
Industry:Computer science
A variant of bubble sort that compares each adjacent pair of items in a list in turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning. It stops when a pass does no swaps.
Industry:Computer science
A variant of bubble sort that compares each adjacent pair of items in a list in turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning. It stops when a pass does no swaps.
Industry:Computer science
A variant of bubble sort that compares each adjacent pair of items in a list in turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning. It stops when a pass does no swaps.
Industry:Computer science
A variant of bubble sort that compares each adjacent pair of items in a list in turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning. It stops when a pass does no swaps.
Industry:Computer science
A variant of divide and conquer in which subproblems created in the "divide" step are merged before the "conquer" step.
Industry:Computer science
A variant of doubly linked list with items in sorted order and having two levels of additional links that span geometrically increasing distances. For a list with n items, the next level is a link from item i, 1 ≤ i ≤ n - ⌊ n <sup>1/3</sup>⌋, to item i + ⌊ i <sup>1/3</sup>⌋. At the top level, items 1³, 2³, 3³, ..., ⌊ n <sup>1/3</sup>⌋ ³ have backward links, that is, there is a link from item i³, 1 < i ≤ ⌊ n <sup>1/3</sup>⌋ ³, to item (i-1)³. Search, insert, and delete are O(n<sup>1/3</sup>) worst case.
Industry:Computer science
