Hardware Reference
In-Depth Information
Start
iteration
←
N − 1
in_order
←
1
inner
←
←
iteration
i
0
No
array[i] > array[i+1]?
Yes
swap array[i] & array[i+1]
in_order
0
←
inner
←
←
inner − 1
i
i + 1
No
inner = 0?
Yes
Yes
in_order = 1?
no
Iteration
←
iteration − 1
No
iteration = 0?
Yes
Stop
Figure 4.7
■
Logic flow of bubble sort
SP
iteration
SP+1
SP+2
SP+3
inner
inOrder
buf
X
Y
A
B
return address
SP+12
SP+13
N
arrayX
Figure 4.8
■
Stack frame for bubble sort
Search WWH ::
Custom Search