Definitions from Wikipedia (Stack-sortable permutation)

▸ noun:  In mathematics and computer science, a stack-sortable permutation (also called a tree permutation) is a permutation whose elements may be sorted by an algorithm whose internal storage is limited to a single stack data structure.


▸ Words similar to stack-sortable permutation
▸ Usage examples for stack-sortable permutation

▸ Idioms related to stack-sortable permutation
▸ Wikipedia articles (New!)
▸ Words that often appear near stack-sortable permutation
▸ Rhymes of stack-sortable permutation

▸ Invented words related to stack-sortable permutation