0
A bubble sort may have a range from O(n-1) for a pre-sorted array, to O(n2-n) for a poorly implemented bubble sort algorithm.
Given 20 elements, a best case scenario is 19 comparisons, and the worst case is 380 comparisons.
Wiki User
∙ 12y ago
Wiki User
∙ 8y agoFor an array of length n, there are n*n comparisons (n squared) in a bubble sort; however, the algorithm can be optimized to reduce the number of comparisons by keeping track of where the last swap occurs on each iteration of the outer loop. Everything after that point is already sorted, thus the next iteration can stop comparing once that point is reached.
Wiki User
∙ 9y agoFor a sequence of n elements, the minimum number of comparisons is n-1 (a single pass) in bubble sort. However, this can only happen when the sequence is already in sorted order! The worst case is (n-1)! (or factorial (n-1)) when the sequence is in reverse order.
Bubble sort is often cited as an example of how NOT to write an algorithm. Insertion sort is demonstrably more efficient on small sequences but is also used in hybrid sorts of larger sequences (where large sequences are broken down into short sequences that can be efficiently sorted using insertion sort).
Add your answer:
Earn +20 pts
What is the purpose of the flag variable in a bubble sort?
to eliminate unnecessary swaps to eliminate unnecessary comparisons to stop as soon as the list is sorted to sort an array of unknown size
Why is the Bubble Sort algorithm also referred ro as Sink Sort?
Bubble sort got its name because if you could watch the way your data was changing, on each iteration you would see the greatest number "bubble" to the top.Similarly, you could said that you would see the lowest number "sink" to the bottom.
What is another name for bubble sort?
Bubble sort is also known as sinking sort.
What is the difference between bubble sort and selection sort in pascal?
The traditional bubble sort moves any number of elements at most one position per iteration, while selection sort moves exactly one element per iteration. Both sorts require an exponential amount of time to produce their results.
Who invented the bubble sort?
ramesh
What is the purpose of the flag variable in a bubble sort?
to eliminate unnecessary swaps to eliminate unnecessary comparisons to stop as soon as the list is sorted to sort an array of unknown size
Why is the Bubble Sort algorithm also referred ro as Sink Sort?
Bubble sort got its name because if you could watch the way your data was changing, on each iteration you would see the greatest number "bubble" to the top.Similarly, you could said that you would see the lowest number "sink" to the bottom.
What is another name for bubble sort?
Bubble sort is also known as sinking sort.
What is the difference between bubble sort and selection sort in pascal?
The traditional bubble sort moves any number of elements at most one position per iteration, while selection sort moves exactly one element per iteration. Both sorts require an exponential amount of time to produce their results.
Who invented the bubble sort?
ramesh
Bubble sort Extra or in space?
Bubble sort is an "in place" algorithm. Other than a temporary "switch" variable, no extra space is required.
What is bubble sort and explain with examples?
bubbles
Can you draw a flow chart for bubble sort?
no
What are some sorting rules for math?
Binary sort and bubble sort are two.
How do you sort the given contents of an array?
You would sort the given elements of an array by a bubble sort or heap sort code!!
What are the advantages for bubble sort?
Bubble sort has no practical applications other than that it is often cited as an example of how not to write an algorithm. Insert sort is the best algorithm for sorting small lists of items and is often used in conjunction with quick sort to sort larger lists. Like insert sort, bubble sort is simple to implement and is a stable sort (equal items remain in the same order they were input). However, insert sort uses copy or move operations rather than swaps (which is actually three operations per swap) and is therefore quicker. The only time a bubble sort will work quicker than insert sort is when the array is already sorted, which renders the entire algorithm redundant. A modified algorithm that specifically tests if an array is sorted or not would be more efficient than a single-pass bubble sort.
Can you modify the bubble sort algorithm to search to sort an array of characters instead of array of integers?
The bubble sort algorithm can be applied to an array of characters. Every character can be translated to an integer equivalent via the ascii table
