0
procedure bubbleSort( A : list of sortable items ) defined as:
do
swapped := false
for each i in 0 to length(A) - 1 inclusive do:
if A[i] > A[i+1] then
swap( A[i], A[i+1] )
swapped := true
end if
end for
while swapped
end procedure
Wiki User
∙ 14y ago
Add your answer:
Earn +20 pts
What is another name for bubble sort?
Bubble sort is also known as sinking sort.
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.
What is time complexity of bubble sort?
O(n*n)
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.
Can you draw a flow chart for bubble sort?
no
What is bubble sort and explain with examples?
bubbles
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!!
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.
When would you use bubble sort?
Never. Bubble sort is often cited as an example of how not to write a sorting algorithm and is used purely as a programming exercise. It is never used in production code. Although reasonably efficient when sorting small lists, an insertion sort performs better on average. But for larger lists it has no practical uses. A merge sort is better for large lists, but if stability isn't an issue a quick sort is even better. Hybrid sorts typically use quick sort until a partition is small enough for an insertion sort to complete the job.
