# 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.

## 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.

## bubble sort

A sorting technique that is typically used for sequencing small lists. It starts by comparing the first item to the second, the second to the third and so on until it finds one item out of order. It then swaps the two items and starts over. The sort may alternate from the top of the list to the bottom and then from the bottom to the top. The name comes from the notion that items are raised or "bubbled up" to the top. See sort algorithm.
References in periodicals archive ?
Therefore, Bubble Sort algorithm has a maximum polynomial time O (n2), which is equal with its average performance time.
The Bubble Sort algorithm proved to be the most inefficient, obtaining in java an average run-time / array of 1329.853091 microseconds, in C ++ an average run-time / vector of 3339.091910 microseconds, and in C# an average run-time / vector of 5591.868977 microseconds.
Considering that the global optimal solutions often locate on or near the boundary of the feasible region for many COPs, we choose some better solutions in [G.sub.ifs] based on bubble sort algorithm (BS) and add to [G.sub.fs] in order to improve the searching ability.

Site: Follow: Share:
Open / Close