0
to eliminate unnecessary swaps to eliminate unnecessary comparisons to stop as soon as the list is sorted to sort an array of unknown size
Wiki User
∙ 12y ago
Anonymous
To eliminate unnecessary swap
Add your answer:
Earn +20 pts
What is another name for bubble sort?
Bubble sort is also known as sinking sort.
Who invented the bubble sort?
ramesh
Can you draw a flow chart for bubble sort?
no
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!!
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
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 another name for bubble sort?
Bubble sort is also known as sinking sort.
What is complex sort?
Time complexity Best case: The best case complexity of bubble sort is O(n). When sorting is not required, all the elements are already sorted. Average case: The average case complexity of bubble sort is O(n*n). It occurs when the elements are jumbled, neither properly ascending nor descending. Worst case: The worst-case complexity of bubble sort is O(n*n). It occurs when the array elements are needed to be sorted in reverse order. Space complexity In the bubble sort algorithm, space complexity is O(1) as an extra variable is needed for swapping.
Who invented the bubble sort?
ramesh
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 is the purpose of the control group?
The purpose of a control group is to show what would happen under normal conditions. It serves as a comparison to the results you receive from the manipulation of the independent variable on the dependent variable. If a control group is present in an experiment, one can be more certain that the independent variable is really responsible for the observations.
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
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.
