NIST

blind sort

(algorithm)

Definition: A specialized sort algorithm that first builds a blind trie, then traverse the tree left to right.

Generalization (I am a kind of ...)
sort.

Aggregate parent (I am a part of or used in ...)
suffix array.

Aggregate child (... is a part of or used in me.)
blind trie, depth-first search.

See also treesort (1).

Note: Used in a specialized algorithm to build suffix arrays.

Author: PEB

More information

Paolo Ferragina and Roberto Grossi, The string B-tree: a new data structure for string search in external memory and its applications, Journal of the ACM, 46(2):236 - 280, March 1999.


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 19 December 2007.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "blind sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 19 December 2007. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/blindSort.html