COSC 1P03 Data Structures and Abstraction 20.1

COSC 1P03
Data Structures and Abstraction
pass 1
3 5 2 7 1 6 8 4
pass 5
3 5 2 7 1 4 6 8
pass 2
3 5 2 7 1 6 8 4
pass 6
3 5 2 1 4 6 7 8
pass 3
3 5 2 7 1 6 4 8
pass 7
3 5 1 2 4 6 7 8
pass 4 3 5 2 7 1 4 6 8
Figure 20.11 Insertion sort
pass 8
3 1 2 4 5 6 7 8
COSC 1P03
Exchange (Bubble) Sort
Principle
exchange pairs if out of order
works?
quit?
Pehaviour
largest “bubbles” to end
next pass doesn’t have to go to end
Analysis
each pass moves 1 item to correct spot
O(n) passes
ave O(n) pairs
O(n 2 )
early termination
no exchanges
O(n) if sorted
E.g. mark list in array
In situ, stable
Data Structures and Abstraction 20.20
pass 1
3 5 2 7 1 6 8 4
3 5 2 7 1 6 8 4
pass 3
2 3 1 5 6 4 7 8
2 3 1 5 6 4 7 8
3 2 5 7 1 6 8 4
2 1 3 5 6 4 7 8
3 2 5 7 1 6 8 4
2 1 3 5 6 4 7 8
3 2 5 1 7 6 8 4
2 1 3 5 6 4 7 8
3 2 5 1 6 7 8 4
3 2 5 1 6 7 8 4
pass 4
2 1 3 5 4 6 7 8
1 2 3 5 4 6 7 8
pass 2
3 2 5 1 6 7 4 8
1 2 3 5 4 6 7 8
2 3 5 1 6 7 4 8
1 2 3 5 4 6 7 8
2 3 5 1 6 7 4 8
2 3 1 5 6 7 4 8
2 3 1 5 6 7 4 8
2 3 1 5 6 7 4 8
pass 5
pass 6
1 2 3 4 5 6 7 8
1 2 3 4 5 6 7 8
1 2 3 4 5 6 7 8
1 2 3 4 5 6 7 8
1 2 3 4 5 6 7 8
Figure 20.14 Exchange sort
pass 7
1 2 3 4 5 6 7 8
20.7