bubble sort
(redirected from Bubble sort algorithm)bubble sort
[′bəb·əl ‚sȯrt] (computer science)
A procedure for sorting a set of items that begins by sequencing the first and second items, then the second and third, and so on, until the end of the set is reached, and then repeats this process until all items are correctly sequenced.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
bubble sort
A 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. 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.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)