Algoritma

Pemrograman 2
#3 BUBBLE SORT ?

SWS – YUNUS
BUBBLE SORT ?

Algoritma sederhana untuk pengurutan sekumpulan data

dengan membandingkan sekaligus menukar data (kalau
pengkondisiannya bernilai true) dari nilai n dengan nilai n+1

Banyak Perbandingan
= ( jumlahData – 1 ) x ( jumlahData – 1 )

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9

4 7 3 9

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9

4 7 3 9

4 3 7 9

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9

4 7 3 9

4 3 7 9

4 3 7 9

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9 4 3 7 9

4 7 3 9 3 4 7 9

4 3 7 9

4 3 7 9

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9 3 4 7 9

4 7 3 9 3 4 7 9

4 3 7 9 3 4 7 9

4 3 7 9

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9 3 4 7 9

4 7 3 9 3 4 7 9

4 3 7 9 3 4 7 9

4 3 7 9 3 4 7 9

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9 3 4 7 9 3 4 7 9

4 7 3 9 3 4 7 9 3 4 7 9

4 3 7 9 3 4 7 9

4 3 7 9 3 4 7 9

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9 3 4 7 9 3 4 7 9

4 7 3 9 3 4 7 9 3 4 7 9

4 3 7 9 3 4 7 9 3 4 7 9

4 3 7 9 3 4 7 9

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9 3 4 7 9 3 4 7 9

4 7 3 9 3 4 7 9 3 4 7 9

4 3 7 9 3 4 7 9 3 4 7 9

4 3 7 9 3 4 7 9 3 4 7 9

SWS – YUNUS
CARA KERJA BUBBLE SORT
ASCENDING

4 7 3 9 3 4 7 9 3 4 7 9

4 7 3 9 3 4 7 9 3 4 7 9

4 3 7 9 3 4 7 9 3 4 7 9

4 3 7 9 3 4 7 9 3 4 7 9

SWS – YUNUS
NOTASI PSEUDOCODE

func bubbleSortASC (var ar as array)

for j from 0 to length(ar)-1
for i from 0 to length(ar)-1
if (ar[i] > ar[i+1] )
swap (ar[i] , ar[i+1] )
end if
end for
end for
end func

SWS – YUNUS
 NEX
T
#3P BUBBLE
SORTING

SWS – YUNUS
 THANK YOU
KEEP LEARNING & KEEP
SPIRITS

SWS – YUNUS