Bubble sort is the simplest sorting algorithm that works by repeatedly swapping adjacent items if they are out of order.
What is a bubble sort used for?
Bubble Sort is a basic algorithm for arranging a series of numbers or other elements in the correct order. The method works by examining each set of adjacent elements in the string from left to right and changing their positions if they are out of order.
Why is Bubble Sort bad?
Bubble Sort is one of the most debated algorithms simply because of its inefficiency in sorting arrays. If an array is already sorted, Bubble Sort only traverses the array once (using concept two below), but the worst case is O(N²) running time, which is extremely inefficient.
What is a bubble sort code?
Bubble sort, sometimes called descending sort, is a simple sorting algorithm that iterates through the list, comparing neighboring items and swapping them if they’re out of order. The traversal through the list is repeated until the list is sorted.