Wikipedia:Articles for deletion/Bozo sort

The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.

The result of the debate was merge and redirect. Johnleemk | Talk 08:32, 28 January 2006 (UTC)

[edit] Bozo sort

non encyclopedic algorithm Melaen 00:43, 22 January 2006 (UTC)

• Delete per above Liamdaly620 00:50, 22 January 2006 (UTC)
• Delete, no source information. Gazpacho 01:22, 22 January 2006 (UTC)
• Delete per nom --TBC 01:30, 22 January 2006 (UTC)
• Comment: the source code is of no use but I had heard the term with the meaning pointed in the article. No idea whether programmer's slang is notable enough, though. Pavel Vozenilek 01:58, 22 January 2006 (UTC)
• Delete as probable hoax. Also, it will not definitely "one day finish," unless that day is an infinite amount of time in the future. Peyna 03:11, 22 January 2006 (UTC)
• Delete per nom. --Lockley 05:15, 22 January 2006 (UTC)
• Merge to bogo sort but snip heavily. Something along the lines of "even more inefficient is the bozo sort, which only swaps two items on each iteration". And yes, the worst case running time is indeed infinite, so there is no guarantee the algorithm will ever finish. Imagine a case where it always swaps the same two items, for example. JIP | Talk 08:41, 22 January 2006 (UTC)
• Keep. It is useful in the study of the analysis of algorithms. -- Mikeblas 15:55, 22 January 2006 (UTC)
  • The bozo sort is simply a trivial variation of the bogo sort. The concept of an algorithm that does random changes to a set until it happens to get it in sorted order is useful in algorithm analysis but these two algorithms are far too similar to deserve individual articles. JIP | Talk 16:28, 22 January 2006 (UTC)
• Merge with bogo sort. They are vaguely useful in comparison of sorting algorithms (e.g. "efficiency of sorting algorithms range from the unimaginably inefficient bozo sort, through the naive O(n²) sorts, to the fast O(nlogn) sorts") --대조 | Talk 17:28, 22 January 2006 (UTC)
• Merge with bogo sort. And my compliments to the CS theorist who came up with this one -- it borders on BJAODN if you're into that sort of thing. Haikupoet 03:21, 23 January 2006 (UTC)
• Slight merge and redirect to Bogo sort. If the source code is any good, transwiki it to Wikisource or something. Stifle 16:29, 23 January 2006 (UTC)
• Merge to Bogo sort. How many stupid sorts are there to delete?? —Quarl ^(talk) 2006-01-24 05:31Z

The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.