Scribd
Upload
189 views

Bubble Sort Example

The document describes how bubble sort works by sorting a sample list of numbers. Bubble sort compares adjacent elements and swaps them if they are in the wrong order until the list is fully sorted. Each pass through the list sorts more elements until after multiple passes, the list is fully sorted. The algorithm knows it is finished when it completes a pass without any swaps, requiring fewer comparisons each pass until the list is sorted.

Uploaded by

nur_anis_8
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
189 views

Bubble Sort Example

The document describes how bubble sort works by sorting a sample list of numbers. Bubble sort compares adjacent elements and swaps them if they are in the wrong order until the list is fully sorted. Each pass through the list sorts more elements until after multiple passes, the list is fully sorted. The algorithm knows it is finished when it completes a pass without any swaps, requiring fewer comparisons each pass until the list is sorted.

Uploaded by

nur_anis_8
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 7

Bubble Sort Example

9,
6,
6,
6,
6,
6,
6,
6,

6,
9,
2,
2,
2,
2,
2,
2,

2,
2,
9,
9,
9,
9,
9,
9,

12,
12,
12,
12,
11,
11,
11,
11,

11, 9, 3, 7
11, 9, 3, 7
11, 9, 3, 7
11, 9, 3, 7
12, 9, 3, 7
9, 12, 3, 7
9, 3, 12, 7
9, 3, 7, 12

Bubblesort
Bubblesortcompares
comparesthe
thenumbers
numbersin
inpairs
pairsfrom
fromleft
leftto
toright
right
exchanging
when
necessary.
Here
the
first
number
is
compared
exchanging when necessary. Here the first number is comparedto
to
the
second
and
as
it
is
larger
they
are
exchanged.
the second and as it is larger they are exchanged.
Now
Nowthe
thenext
nextpair
pairof
ofnumbers
numbersare
arecompared.
compared. Again
Againthe
the99isisthe
the
larger
and
so
this
pair
is
also
exchanged.
larger and so this pair is also exchanged.
In
Inthe
thethird
thirdcomparison,
comparison,the
the99isisnot
notlarger
largerthan
thanthe
the12
12so
sono
no
exchange
is
made.
We
move
on
to
compare
the
next
pair
without
exchange is made. We move on to compare the next pair without
any
anychange
changeto
tothe
thelist.
list.
The
The12
12isislarger
largerthan
thanthe
the11
11so
sothey
theyare
areexchanged.
exchanged.

The
Thetwelve
twelveisisgreater
greaterthan
thanthe
the99so
sothey
theyare
areexchanged
exchanged
The
Theend
endof
ofthe
thelist
listhas
hasbeen
beenreached
reachedso
sothis
thisisisthe
theend
endof
ofthe
thefirst
firstpass.
pass. The
The
twelve
twelveat
atthe
theend
endof
ofthe
thelist
listmust
mustbe
belargest
largestnumber
numberin
inthe
thelist
listand
andso
soisisnow
nowin
in
The
12
is
greater
than
the
3
so
they
are
exchanged.
the
We
pass
Theposition.
12
is greater
than
the
3aso
they
are from
exchanged.
thecorrect
correct
position.
Wenow
nowstart
start
anew
new
pass
fromleft
leftto
toright.
right.
The
The12
12isisgreater
greaterthan
thanthe
the77so
sothey
theyare
areexchanged.
exchanged.

Bubble Sort Example


First Pass

6, 2, 9, 11, 9, 3, 7, 12
Second Pass
6, 6,
2,
2, 9, 9,
11, 3,
11,
9, 7,
11,
3, 11,
7, 12
Notice
Noticethat
thatthis
thistime
timewe
wedo
donot
nothave
haveto
tocompare
comparethe
thelast
lasttwo
two
numbers
as
we
know
the
12
is
in
position.
This
pass
therefore
numbers as we know the 12 is in position. This pass thereforeonly
only
requires
6
comparisons.
requires 6 comparisons.

Bubble Sort Example


First Pass

6, 2, 9, 11, 9, 3, 7, 12
Second Pass
2,
6,
9,
9,
3,
7,
11,
12
Third Pass
2, 6, 9, 3,
9, 7,
3, 9,
9,
7, 11, 12
This
Thistime
timethe
the11
11and
and12
12are
arein
inposition.
position. This
Thispass
passtherefore
thereforeonly
only
requires
requires55comparisons.
comparisons.

Bubble Sort Example


First Pass

6,
Second Pass
2,
Third Pass
2,
Fourth Pass
2,

2,
6,
6,
6,

9,
9,
9,
9,
3,

11, 9, 3, 7,
9, 3, 7, 11,
3, 7, 9, 11,
3, 9,
9,
7,
7, 9, 11,

12
12
12
12

Each
Eachpass
passrequires
requiresfewer
fewercomparisons.
comparisons. This
Thistime
timeonly
only44are
areneeded.
needed.

Bubble Sort Example


First Pass

6,
Second Pass
2,
Third Pass
2,
Fourth Pass
2,
Fifth Pass
2,

2,
6,
6,
6,
6,
3,

9,
9,
9,
3,
3,
6,

11, 9, 3, 7,
9, 3, 7, 11,
3, 7, 9, 11,
7, 9, 9, 11,
7, 9, 9, 11,

12
12
12
12
12

The
Thelist
listisisnow
nowsorted
sortedbut
butthe
thealgorithm
algorithmdoes
doesnot
notknow
knowthis
thisuntil
untilitit
completes
completesaapass
passwith
withno
noexchanges.
exchanges.

Bubble Sort Example


First Pass

6,
Second Pass
2,
Third Pass
2,
Fourth Pass
2,
Fifth Pass
2,
Sixth Pass
2,

2,
6,
6,
6,
3,
3,

9,
9,
9,
3,
6,
6,

11, 9, 3, 7,
9, 3, 7, 11,
3, 7, 9, 11,
7, 9, 9, 11,
7, 9, 9, 11,
7, 9, 9, 11,

12
12
12
12
12
12

This
Thispass
passno
noexchanges
exchangesare
aremade
madeso
sothe
thealgorithm
algorithmknows
knowsthe
thelist
listisis
sorted.
sorted. ItItcan
cantherefore
thereforesave
savetime
timeby
bynot
notdoing
doingthe
thefinal
finalpass.
pass. With
With
other
otherlists
liststhis
thischeck
checkcould
couldsave
savemuch
muchmore
morework.
work.

Bubble Sort Example


Quiz Time

1. Which number is definitely in its correct position at the


end of the first pass?
Answer: The last number must be the largest.
2. How does the number of comparisons required change as
the pass number increases?
Answer: Each pass requires one fewer comparison than the last.
3. How does the algorithm know when the list is sorted?
Answer: When a pass with no exchanges occurs.
4. What is the maximum number of comparisons required
for a list of 10 numbers?
Answer: 9 comparisons, then 8, 7, 6, 5, 4, 3, 2, 1 so total 45

You might also like