bogosort
/B OW1 G AH0 S AO1 R T/noun
- 1
(computing theory, informal) An intentionally poor sorting algorithm that operates by randomly permuting the elements repeatedly until they happen to fall into the correct order.
Translate “bogosort” into another language
Choose a language below to open the translator with English selected as the source language.