Bubble sort is a simple sorting algorithm. It works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort.
Bubble sort
topic information
general information about Bubble sort
|
Aliases:
0099-c511
|
related topics
topics related to Bubble sort
message stream 
messages about Bubble sort
10 Days of Sorting – kicking off with the Bubble Sort – Aaron McGowan
amcgowanca
10 days of sorting - kicking off with the Bubble Sort http://bit.ly/cYjcom #programming #cpp #sort #science #mathematics
7 ½ days ago
from
TweetDeck
MrFyhr
| iPhone | Bubble Sort Lite (games) - Bubble Sort Lite 1.0Category: GamesPrice: Free (iTunes)Description:See how qu... http://ow.ly/16OgvT
6 ½ days ago
from
HootSuite
MrFyhr
| iPhone | Bubble Sort (games) - Bubble Sort 1.0Category: GamesPrice: $0.99 (iTunes)Description:See how quickly you... http://ow.ly/16OgvU
6 ½ days ago
from
HootSuite
Harvard Computer Science Lecture
thefarmproject
From Academic Earth: Sorting: Bubble Sort, Selection Sort, and Merge Sort - David J. Malan, Harvard Computer Science: http://bit.ly/baMvz3
2 days ago
from
twitterfeed
listware
http://www.listware.net/201003/haskell-cafe/65844.html Haskell-cafe - Bubble sort algorithm implementations (Haskell vs. C)
23 hours ago
from
API
