
	Where results make sense

Topic: Bogosort

Related Topics

Bucket sort

Stupid sort

Pigeonhole sort

Comb sort

Pancake sorting

Merge sort

Shell sort

Bead sort

Cocktail sort

Smoothsort

Several Unique Sort

Binary tree sort

CDC 7600

Anisotropy

Kunisada

In the News (Thu 9 Jul 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	BogoSort (Site not responding. Last check: 2007-10-09)
		And if the number of processors meets or exceeds the number of elements to be sorted, well, it's REAL easy.
		Modified, you end up with stuff like simulated annealing; in fact, you could adapt bogosort to a simulated annealing framework, which might be kinda fun.
		(SA and GA programs lend themselves to clusters.) But you'd have to change a lot of the assumptions about the data for anything resembling a bogosort to be considered optimal.
	www.kernel-panic.org /pipermail/kplug-lpsg/2002-May/002767.html (401 words)

	Bogosort - Wikipedia, the free encyclopedia
		It also faces the same pseudo-random problems as bogosort—it may never terminate.
		An in-joke among some computer scientists is that quantum computing could be used to effectively implement a bogosort with a time complexity of O(n).
		Bogosort: an implementation that runs on Unix-like systems, similar to the standard sort program.
	en.wikipedia.org /wiki/Bogosort (587 words)

	Main Page - BogoWiki (Site not responding. Last check: 2007-10-09)
		According to the Jargon File, the bogosort is "the archetypal perversely awful algorithm".
		Being that I use BogoSort as my online handle, the natural conclusion is that I am the archetypal perversely awful person.
		A Johari Profile would seem to conclude that I am Calm, Clever, Intelligent, and Witty, with a bit of Knowledgeable, Organized, and Quiet thrown in.
	www.bogosort.org (86 words)

	Slow Sort
		This function grows mindbogglingly fast (and there are not many values known; when I worked on that topic 20 years ago the highest x was 4) and is not computable on a turing machine (there is a proof by contradiction using just this function C).
		My favorite thing about BogoSort is that it checks order on each iteration, yet it is still O(n!) for sorted inputs.
		The worst-case run time of BogoSort and this variant is infinite.
	c2.com /cgi/wiki?SlowSort (830 words)

	bogosort (Site not responding. Last check: 2007-10-09)
		bogosort sorts files or its standard input using the bogo-sort algorithm.
		For a description of bogosort see the manual page or the info manual.
		Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved.
	www.lysator.liu.se /~qha/bogosort (71 words)

	community project proposal - GIDForums
		bogosort is an unstable sort which has no use whatsoever in real world.
		In bogosort, you just randomly shuffle the elements in your unsorted list, and check each time if the list is sorted.
		It could be sorted in the first try (stranger things have happened) or it could take an eternity.
	www.gidforums.com /t-4893.html (170 words)

	The Old Joel on Software Forum - Intentionally Inefficient Algorithms
		This is basically a variation on BogoSort, the canonical perversly inefficient sort.
		When I was in school, a common exam question was to state an incredibly awful sort algorithm, and then ask for a proof that it was a working sort algorithm and a bound on its asymptotic performance.
		Comparing this with an earlier post of yours, "knows all that 'school' stuff inside out", I guess I wouldn't be admitted to Microsoft; I studied maths, not CS, so apparently I'm reinventing a wheel here.
	discuss.fogcreek.com /joelonsoftware/default.asp?cmd=show&ixPost=113177 (873 words)

	mgroves.com : Home
		If you were to apply bogosort to a deck of cards, it would consist of playing 52-pick up over and over until the cards end up in sorted order.
		It also occurred to me that Bogosort is the one thing that both sides of the Intelligent Design debate have in common.
		ID says that bio-genesis comes from Bogosort, but that some divine force has loaded the dice (not provable).
	www.mgroves.com /blog_archive.php?blogID=182 (387 words)

	DM's Esoteric Programming Languages - Bogobogosort
		Bogobogosort is a sorting algorithm based on the popular bogosort algorithm.
		To undestand bogobogosort, it is necessary to first have an understanding of the finer points of bogosort.
		Step 1, the checking if the list is sorted, is assumed to be done with some sort of efficient one-pass comparison check, which takes n-1 operations.
	www.dangermouse.net /esoteric/bogobogosort.html (237 words)

	daver (Site not responding. Last check: 2007-10-09)
		It is similar to trying to sort a deck of cards by shuffling them and then checking to see if they are in order.
		The source for the bogosort function is here.
		Bogosort has a terrible time dealing with anything but really small arrays.
	www.gomerbud.com /daver/bad_code/bogosort (214 words)

	The BogoSort
		This blog entry is partly to share what I think is a fascinating story along with some very useful information.
		The February 2005 issue of Java Developer’s Journal has an excellent article on Extreme Programming that is well worth taking the time to read.
		Today is the 49th birthday of Bill Gates: Co-founder and Chief Software Architect of Microsoft, founder (along with his wife, Melinda) of the Bill & Melinda Gates Foundation, namesake of a Costa Rican insect, and supplier of many fascinating quotations (a few of which he actually said), such as...
	bogosort.blogspot.com (2240 words)

	graham mitchell - news July 2003
		Now, sort of an inside joke in many computer science classes is the "bogosort", which is a method for sorting values which is as slow as possible while still actually eventually producing a sorted list.
		The whole point of the bogosort is that it's mind-bogglingly slow.
		Now, what makes me a super nerd is that a little over six months ago, I downloaded the bogosort code, looked it over, and noticed that it wasn't mixing up the data as efficiently as my own randomizer.
	grahammitchell.com /archives/2003-07.shtml (1438 words)

	Bogosort
		Bogosort wird gemeinhin als Synonym für den schlechtest möglichen Algorithmus benutzt.
		Da er ein gutes Beispiel dafür ist, zu welchen Grausamkeiten der menschliche Geist ist der Lage ist, habe ich ihn mal in die illustre Runde der Sortieralgorithmen aufgenommen.
		Für Bogosort bedeutet dies im günstigsten Fall also insgesamt ebenfalls eine Laufzeit von O(n), wobei der günstigste Fall der ist, in dem U bereits sortiert ist.
	www.hipphampel.de /index.php?item=cpp/sorting/bogosort (424 words)

	Knowing whats best. - GameDev.Net Discussion Forums (Site not responding. Last check: 2007-10-09)
		When you get to implementing algorithms, remember that the execution complexity (big-O) is far more important in virtually all cases than the number of clocks it takes to run the instructions.
		You may have written the fastest, tightest bogosort in all of history, but it's still a bogosort, and it will still be outperformed by...
		I like to refer a lot to this article as it gives a lot of excellent advice for how to approach code optimization.
	www.gamedev.net /community/forums/topic.asp?topic_id=254797&whichpage=1� (1240 words)

	The Nohari Window - Describe BogoSort
		By describing your failings from a fixed list of adjectives, then asking your friends and colleagues to describe you from the same list, a grid of perceived and unrecognised weaknesses can be explored.
		Warning: If you're hacking URLs, this might not be the BogoSort you know, it could just be someone else who's used the name.
		Ask your BogoSort if this is really their Nohari Window.
	kevan.org /nohari?name=BogoSort (175 words)

	Interactive Johari Window - Describe BogoSort
		By describing yourself from a fixed list of adjectives, then asking your friends and colleagues to describe you from the same list, a grid of overlap and difference can be built up.
		You are reading this page because BogoSort wants to know how you'd describe him or her - pick the five or six words from the list below that you think describe BogoSort the best.
		Ask your BogoSort if this is their Johari Window.
	kevan.org /johari?name=BogoSort (191 words)

	FreshPorts -- misc/bogosort
		Update to bogosort-0.4.0, which includes fixes to the error handling and printing routines, the problem originally found by Kris Kennaway.
		Unfortunately, the bogosort author did not quite apply the patch I sent, hence the need for the new files/patch-bogosort.c.
		Add bogosort 0.3.1, a program that sorts files (or stdin) using the bogo-sort algorithm described in the Jargon File.
	www.freshports.org /misc/bogosort (370 words)

	Ruby-lang - Bogosort (Site not responding. Last check: 2007-10-09)
		I wrote it as a 'Hello World' in the language, and put up here as an example.
		It probably isn't nice / efficient (you'd smile at that term if you already know what BogoSort is) code in the language, but it works.
		The content on this web site is licensed under a Creative Commons License.
	mm.bbspals.org /code/examples/ruby-bogosort.html (78 words)

	[No title] (Site not responding. Last check: 2007-10-09)
		#ifndef SORT_H #define SORT_H //Programmer: Clayton Price date: 11-24-01 //File: sort.h class: cs 53 //Purpose: This file contains the prototypes for bogosort functions.
		#include "random.h" // Data set size constant const short siSIZE = 6; // The bogosort function produces a random ordering of the indices of the array // to be sorted.
		void bogosort (short rgsiNewOrder[]); // The inorder function returns a boolean value -- true if the elements of // the first array parameter are in ascending order according to the element // order given in the second parameter array.
	web.umr.edu /~price/cs53/fs01/sort.h (193 words)

	The Daily WTF - Reply to an Existing Message - Re: Your $500,000 System (Site not responding. Last check: 2007-10-09)
		A lot of highly portable low-level code is an absolute mess of macros, branches, and supporting functions, in order to make up for the differences and deficiencies of different compilers/databases/etc, and optimize the speed under different circumstances and architectures.
		(The BSD str* functions are good examples.) It might take some work to figure out if it's a badass bit of great code once the light shines, or a glorified bogosort.
		Of course, leaving it as simply good, standard, short code beats tuning it into a turbocharged racing machine for anything that's not a simple library function.
	thedailywtf.com /forums/AddPost.aspx?PostID=35806&Quote=True (219 words)

	OKCupid! bogosort / 26 / m / straight / Vienna, Virginia, United States (Site not responding. Last check: 2007-10-09)
		bogosort / 26 / m / straight / Vienna, Virginia, United States
		We can't reply to every message, but we'll read them all.
		You can browse bogosort's pictures, message him, and check your compatibility.
	www.okcupid.com /profile?tuid=11282576805890664680 (775 words)

	Bogosort \| THG Lexikon (Site not responding. Last check: 2007-10-09)
		Der Begriff Bogosortierung oder englisch Bogosort bezeichnet ein nicht-stabiles Sortierverfahren, bei dem die Elemente so lange zufällig gemischt werden, bis sie sortiert sind.
		Wegen der langen Laufzeit ist Bogosort der Prototyp eines schlechten Algorithmus.
		use List::Util qw(shuffle); sub bogosort { my @a = @_; @a = shuffle @a until is_sorted @a; return @a; } sub is_sorted { while (@_ > 1) { return if $_[ 0 ] > $_[ 1 ]; shift @_; } return 1; }
	www.tomshardware.de /lexikon/Bogosort (410 words)

	[No title] (Site not responding. Last check: 2007-10-09)
		//Programmer: Clayton Price date: 11-24-01 //File: sort.cpp class: cs 53 //Purpose: This file contains the definitions of sorting functions for bogosort #include
		#include "sort.h" #include "random.h" // The bogosort function produces a random ordering of the indices of the array // to be sorted.
		void bogosort (short rgsiNewOrder[]) { short siNext; bool bRepeated=false; int j; rgsiNewOrder[0] = getrandom(); for (int i=1;i
	web.umr.edu /~price/cs53/fs01/sort.cpp (166 words)

	The Old Joel on Software Forum - SORT
		But make sure to run it twice in case one slips by.
		I believe the method of superior sorting algorithm you seek is "bogosort".
		Maybe that and the bogosort is just what they teach over there?
	discuss.fogcreek.com /joelonsoftware/?cmd=show&ixPost=170961 (1425 words)

	gummeldur: app-text
		KDE Bible study application using the SWORD library.
		A file sorting program which uses the bogosort algorithm
		Bag of words library - Statistical language modeling, text retrieval, Classification and clustering
	dev.gentoo.org /~karltk/package-index/categories/app-text.html (945 words)

Try your search on: Qwika (all wikis)