Definitions for bubble sort
bub·ble sort

WiktionaryRate this definition:0.0 / 0 votes

1. bubble sortnoun

   A sorting algorithm in which neighboring two values are compared and swapped into right order if necessary in the most inner loop.

WikipediaRate this definition:0.0 / 0 votes

1. Bubble sort

   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 had 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. This simple algorithm 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.

WikidataRate this definition:0.0 / 0 votes

1. Bubble sort

   Bubble sort, sometimes incorrectly referred to as sinking sort, is a simple sorting algorithm that 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. Although the algorithm is simple, most of the other sorting algorithms are more efficient for large lists.

The New Hacker's DictionaryRate this definition:0.0 / 0 votes

1. bubble sort

   Techspeak for a particular sorting technique in which pairs of adjacent values in the list to be sorted are compared and interchanged if they are out of order; thus, list entries ‘bubble upward’ in the list until they bump into one with a lower sort value. Because it is not very good relative to other methods and is the one typically stumbled on by naive and untutored programmers, hackers consider it the canonical example of a naive algorithm. (However, it's been shown by repeated experiment that below about 5000 records bubble-sort is OK anyway.) The canonical example of a really bad algorithm is bogo-sort. A bubble sort might be used out of ignorance, but any use of bogo-sort could issue only from brain damage or willful perversity.

How to pronounce bubble sort?

1. Alex

   US English

   David

   US English

   Mark

   US English

   Daniel

   British

   Libby

   British

   Mia

   British

   Karen

   Australian

   Hayley

   Australian

   Natasha

   Australian

   Veena

   Indian

   Priya

   Indian

   Neerja

   Indian

   Zira

   US English

   Oliver

   British

   Wendy

   British

   Fred

   US English

   Tessa

   South African

How to say bubble sort in sign language?

Numerology

1. Chaldean Numerology

   The numerical value of bubble sort in Chaldean Numerology is: 9

2. Pythagorean Numerology

   The numerical value of bubble sort in Pythagorean Numerology is: 8

References

1. ^ Wiktionary
   https://en.wiktionary.org/wiki/Bubble_Sort
2. ^ Wikipedia
   https://en.wikipedia.org/wiki/Bubble_Sort
3. ^ Wikidata
   https://www.wikidata.org/w/index.php?search=bubble sort
4. ^ The New Hacker's Dictionary
   https://www.gutenberg.org/files/3008/3008-h/3008-h.htm#BubbleSort