Bubble sort
Simple sorting algorithm
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the input list element by element, comparing the current element with the one after it, swapping their values if needed. These passes through the list are repeated until no swaps have to be performed during a pass, meaning that the list has become fully sorted.
Nº Q60864 ★★★
Rare · Knowledge
Bubble sort
Simple sorting algorithm
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the input list element by element, comparing the current element with the one after it, swapping their values if needed. These passes through the list are repeated until no swaps have to be performed during a pass, meaning that the list has become fully sorted.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the input list element by element, comparing the current element with the one after it, swapping their values if needed. These passes through the list are repeated until no swaps have to be performed during a pass, meaning that the list has become fully sorted. The algorithm, which is a comparison sort, is named for the way the larger elements "bubble" up to the top of the list. It performs poorly in real-world use and is used primarily as an educational tool. More efficient algorithms such as quicksort, timsort, or merge sort are used by the sorting libraries built into popular programming languages such as Python and Java.
Text: Wikipédia, CC BY-SA 4.0. · Image: Simpsons contributor (CC BY-SA 3.0) ·
Related cards
Bogosort
Highly ineffective sorting algorithm that successively generates permutations of its input until it finds one that is sorted
Nº Q762850 ★★★
Insertion sort
Sorting algorithm that, at each iteration, inserts the current input element into the suitable position between the already sorted elements
Nº Q117241 ★★
Timsort
Hybrid sorting algorithm based on insertion sort and merge sort
Nº Q942403 ★★★
Heapsort
Worst-case optimal in-place comparison sorting algorithm based on the heap data structure
Nº Q474095 ★★
Topological sorting
An ordering of the vertices of the directed graph for which each edge is directed from earlier to later in the ordering
Nº Q753127 ★★★
Floating point operations per second
Measure of computer performance
Nº Q188768 ★★★