Luckysort

The luckysort (Also lucky sort or lucksort) is a jokingly defined sort algorithm among computer scientists, in which the input data set is already sorted, so the search is always finished instantly. It supposedly is order O(0) because it takes no time. [DADS|Luckysort|luckySort] A similar joke is the bogosort, in which the input data set is randomly rearranged until it is coincidentally sorted.

References

ee also

*Bogosort