Definition: A terribly inefficient sort algorithm that repeatedly changes a random item by a random amount until a sorted permutation occurs. For an array of n elements of k bits each, the expected run time is n × 2nk.
Generalization (I am a kind of ...)
sort algorithm, Las Vegas algorithm.
See also bogosort, bozo sort, permutation sort, stooge sort, lucky sort.
Note: Michael Bernard "came up with tacosort while trying to create an algorithm that is even less efficient than bogosort."
The run time is the same as exhaustive search.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 8 March 2021.
HTML page formatted Mon Mar 8 11:29:19 2021.
Cite this as:
Paul E. Black, "taco sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 8 March 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/tacoSort.html