One of these methods works by first creating a trie and then performing a depth-first tree traversal to lexicographically interpret the keys.
One of these methods works by first creating a trie and then performing a depth-first tree traversal to lexicographically interpret the keys. One of the fastest of these methods works by randomly choosing a pivot element, partitioning elements to the left and right of that element and recursively calling the method on both partitioned sets. John von Neumann developed another one of these methods that works by repeatedly merging two arrays. The simplest of these methods repeatedly goes through the input, swapping two elements, until that process of "bubbling" causes no improvement in results. For 10 points, name this type of algorithm which orders a sequence of data.
One of these methods works by first creating a trie and then performing a depth-first tree traversal to lexicographically interpret the keys.
sorting algorithms [accept all more specific answers]