Bubble Sorts

We are sorting the following list in ascending order:
 
1    4    2    9    3    8    5
 
What does the list look like after one pass of the bubble sort algorithm. 

• 1 2 4 3 8 5 9
• 1 4 2 5 3 8 9
• 4 2 9 3 8 5 1

Which type of sort algorithm is this?

• Bubble
• Merge
• Insertion

May end up making many pointless comparisons

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

moving through a list repeatedly, swapping elements that are in the wrong order

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

In a bubble sort what items do we need to track

• the number of comparisons made

• whether a swap is made

• which items have been swapped

• the largest value in the list

How can a bubble sor be made more efficient?

• Stopping when the number of comparisons in each pass is the same as the length of the list

• Stopping once no swaps are made during a single pass

• Reducing the number of comparisons by 1 after each pass

• Reducing the number swaps made in the first pass

A bubble sort contains..

• Two loops on after the other

• A number of lops depending on the length of the list

• No loops

• Two loops, one inside the other

Improving the efficiency of a bubble sort will..

• require less time to input

• make the program run faster

• make the program run slower

• make the output section of the program run faster

Bubble sorts are usually used to sort

• the lines of on a program

• items in an array

• flowchart items

• variables

In a bubble sort what values do we need to stare in variables?

• the length of the array

• whether a swap has been made

• a variable to store the position in the array

• the length of each item in the array