Bubble sort

From JargonWiki

The Jargon File Parts of this article are based on the Jargon File, v. 4.4.7, a public domain document of hacker jargon.

bubble sort

Usage: n.

bubble sort: n.

Techspeak for a particular sorting technique in which pairs of adjacent values in the list to be sorted are compared and interchanged if they are out of order; thus, list entries `bubble upward' in the list until they bump into one with a lower sort value. Because it is not very good relative to other methods and is the one typically stumbled on by naive and untutored programmers, hackers consider it the canonical example of a naive algorithm. (However, it's been shown by repeated experiment that below about 5000 records bubble-sort is OK anyway.) The canonical example of a really bad algorithm is bogo-sort. A bubble sort might be used out of ignorance, but any use of bogo-sort could issue only from brain damage or willful perversity.

Sources

Public Domain This article is in the public domain and is not subject to copyright, trademark, or any other legal protection of intellectual property. Any and all user contributions to this page are also immediately dedicated to the public domain. Editors of this page must accede to these terms as special conditions of the standard editing privileges.