Each run through the list, from start to finish, is known as a pass. The bubble sort continues until a pass is made where no values have been swapped. At this point, the list is sorted. 4, 27, 7, 12, ...

The biggest problem with a bubble sort is that it takes a very long time to run. For example, if there are 100 values to sort, each pass through the list will take 99 comparisons – and you might have ...

In this article, we present the bubble sort and merge sort algorithms. We discuss the cycle counts of these algorithms on the Blackfin processor, and show how to reduce the cycle count of the bubble ...