Bubble Sort
Sorting Terms
Summary and Analysis
- The Bubble Sort Algorithm
- Bubble Sort Problems
How to Cite This SparkNote

sparknotes

Bubble Sort

< Previous Section
The Bubble Sort Algorithm

Next Section >
How to Cite This SparkNote

Bubble Sort Problems

Problem : Trace the operation of bubble sort on the following list: 4, 7, 2, 5, 6

Solution for Problem 1 >>

Problem : What is the worst case scenario for bubble sort, and why?

Solution for Problem 2 >>

Problem : What simple modification could be made to the bubble sort algorithm that would make it perform more efficiently on the case described above?

Solution for Problem 3 >>

Problem : What would happen if bubble sort didn't keep track of the number of swaps made on each pass through the list?

Solution for Problem 4 >>

< Previous Section
The Bubble Sort Algorithm

Next Section >
How to Cite This SparkNote

Become a fan on Facebook

Help | Feedback

More Help

Ask Miss Marm

Help with grammar, writing, and your papers

Unix Message Board

Ask a question or post an answer.

take a study break

Get on the Dan wagon!

Whether you love or hate Twilight, you’ll ALOL at this.

It Might Not Be Good, But I Love It! Guilty Pleasure Bands

November 6, 2009
When someone uses Britney Spears as a punch line, do...

Essay vs. Multiple Choice: Battle of the Exams

November 6, 2009
By this point in the semester, your tests are probably...

4, 7, 2, 5, 6	The starting configuration
4, 7, 2, 5, 6	4 < 7, so no swap is necessary
4, 2, 7, 5, 6	Swap the 2 and the 7 because 7 > 2
4, 2, 5, 7, 6	Swap the 5 and the 7 becuase 7 > 5
4, 2, 5, 6, 7	Swap the 6 and the 7 because 7 > 6. This is the end of the first pass. Notice how the 7 has "bubbled" up to the top of the list.
2, 4, 5, 6, 7	Swap the two and the 4 because 4 > 2. The list is now in sorted order; the algorithm will detect this on the next pass through the list when it makes no swaps.

SparkNotes

contents