loading…

Skip to content

Simulators

Map Tree Simulators Course Practice Journal Dashboard

Learn

Map
Tree
Simulators
My course
Practice
Journal
Notebook

You

Dashboard
Insights
Progress
Your story
Collection

Play

Arcade
Showcase

More

Feedback

visualiser, B2.4.2 / B2.4.3

Sorting & searching, one comparison at a time

Follow the values as the algorithm runs. Read the theory

50

31

82

13

24

Next: compare positions 0 and 1. Will they swap?predict each comparison

Before it finishes: how many comparisons will the whole sort make?

The trace so far

Predict mode is on. Use the buttons above to say whether the first comparison will swap.

Bubble sort swaps adjacent values that are out of order. Each pass places the largest remaining value. It stops if no swaps occur. Green bars are already in their final place.

Keep going

Practise Algorithms questions →Play Big-O Race →With a class account

Sorting & Searching Visualiser | EduCS