You are on page 1of 1

ALGORITMA BUBBLE SORT

MAIN PROGRAM

Insert

Bubble Sort

A[nElems] = value

Mulai
nElems++

For(out=nElems-1;out>1;out-) For(in=0;in<out;in++)

Insert

Display

a[in]<a[in+1] stop

Bubble Sort
Swap(in;in+1) Display

Display

For(int J=0;J<nElems;J++)

Bubble Sort1
Cetak a[J]

Display

Bubble Sort1

Selesai

For(out=nElems-1;out>=1;out--)

For(in=0;in<out;in++) swap

long temp=a[one] a[one]=a[two] a[two]=temp

a[in]<a[in+1] stop Swap(in;in+1)

You might also like