Bubble sort

Bubble sort

Bubble sort is a basic sorting algorithm that compares adjacent items in a list and swaps their positions if they are in the wrong order. It works by stepping through the entire list and repeating the comparison and swapping process until the list is sorted. The complexity of bubble sort is of order n2.From: Finite Element Mesh Generation [2019], Order-of-addition experiments: A review and some new thoughts [2019], Numerical Methods, Algorithms and Tools in C# [2019], Airline Operations and Scheduling [2019]

Artificial Intelligence Six Cognitive Driven Algorithms

View Chapter

Purchase Book

Published in Rodgers Waymond, Artificial Intelligence in a Throughput Model, 2020

Rodgers Waymond

One of the first algorithms produced was the bubble sort routine. Bubble sort is a technique for organizing numbers, letters or words by looping through a data set, associating each set of values side-by-side, and exchanging them when necessitated for use.

Order-of-addition experiments: A review and some new thoughts

View Article

Journal Information

Published in Quality Engineering, 2019

Dennis K. J. Lin, Jiayu Peng

Note that the problem of finding optimal order appears similar to the traditional “sorting” problem: given an array of m numbers, how to arrange it in an ascending order? As a simple sorting algorithm, “bubblesort” compares a pair of adjacent items at each step and swaps them if they are in the wrong order. The comparison of adjacent items starts from the bottom of list, so that the largest item will move up to the top of array, like a bubble rising to the surface. After the comparison of adjacent items reaches the top of array, the largest element in this array is then determined. We next restart the comparison of adjacent items from the beginning, and the next bubble which rises up to the top is the second largest element, and so on; finally, the correct order is obtained.

Explore chapters and articles related to this topic

Artificial Intelligence Six Cognitive Driven Algorithms

Order-of-addition experiments: A review and some new thoughts