Noun
bogosort (uncountable) (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.