sorting 1. insertion sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2...

16
Sortin g 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 2 4 5 6 9 5 4 3 1 1 2 4 5 9 6 5 4 3 1 1 2 4 9 6 5 5 4 3 1 1 2 9 6 5 5 4 4 3

Upload: janel-rogers

Post on 06-Jan-2018

229 views

Category:

Documents


7 download

DESCRIPTION

Sorting 3. Bubble Sort

TRANSCRIPT

Page 1: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Sorting1. Insertion Sort

3 1 4 4 5 6 2 9 5 1

3 1 4 4 5 6 2 9 5 1

1 3 4 4 5 6 2 9 5 1

1 3 4 4 5 6 2 9 5 1

1 1 3 4 5 6 2 9 5 4

1 1 3 4 5 6 2 9 5 4

1 1 3 4 5 6 2 9 5 4

1 1 2 4 5 6 9 5 4 3

1 1 2 4 5 9 6 5 4 3

1 1 2 4 9 6 5 5 4 3

1 1 2 9 6 5 5 4 4 3

Page 2: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Sorting2. Selection Sort

3 1 4 4 5 6 2 9 5 1

3 1 4 9 5 6 2 4 5 1

3 1 4 9 6 5 2 4 5 1

3 1 4 9 6 5 2 4 5 1

3 1 4 9 6 5 5 4 2 1

3 1 4 9 6 5 5 4 2 1

3 1 2 9 6 5 5 4 4 1

1 1 2 9 6 5 5 4 4 3

1 1 2 9 6 5 5 4 4 3

1 1 2 9 6 5 5 4 4 3

Page 3: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Sorting3. Bubble Sort

3 1 4 4 5 6 2 9 5 1

1 3 1 9 4 5 6 2 5 4

1 1 3 9 6 4 5 5 2 4

1 1 3 9 6 5 4 5 4 2

1 1 2 9 6 5 5 4 4 3

1 1 2 9 6 5 5 4 4 3

1 1 2 9 6 5 5 4 4 3

1 1 2 9 6 5 5 4 4 3

1 1 2 9 6 5 5 4 4 3

1 1 2 9 6 5 5 4 4 3

Page 4: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Lower Bound For SortingDecision Tree

a < b

b < c b < c

a < b < c a < c < b

c < a < b b < a < c

b < c < a c < b < a

a < b ^ a < c a < c a < c b < a ^ c < a

a < b b < aY

Y

Y

Y

Y

N

N

N

N

N

Page 5: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Optimal Sorting Algorithms4. Heapsort

2 4

16

10

3

14

98 7

1

Output:

Page 6: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Optimal Sorting Algorithms4. Heapsort

16

2 1

14

10

3

8

94 7

Output:

Page 7: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Optimal Sorting Algorithms4. Heapsort

2

10

9

3

8

14 7

1614 Output:

Page 8: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Optimal Sorting Algorithms4. Heapsort

161410 Output:

9

3

2

8

14 7

Page 9: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Optimal Sorting Algorithms4. Heapsort

161410 9 Output:

8

37

14 2

Page 10: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Optimal Sorting Algorithms4. Heapsort

161410 9 8 Output:

7

34

4 2

Page 11: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Optimal Sorting Algorithms4. Heapsort

161410 9 8 7 Output:

4

32

1

Page 12: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Optimal Sorting Algorithms4. Heapsort

161410 9 8 7 4Output:

3

12

Page 13: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Optimal Sorting Algorithms4. Heapsort

3 161410 9 8 7 4Output:

2

1

Page 14: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

Optimal Sorting Algorithms4. Heapsort

2 3 161410 9 8 7 4Output:

1

1 2 3 161410 9 8 7 4Final Output:

Page 15: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

5. Mergesort 3 1 4 4 5 6 2 9 5 1

3 1 4 5 1 4 5 6 2 9

3 1 4 5 1 2 9 4 5 6

3 1 4 5 1 9 2 6 4 5

Optimal Sorting Algorithms

5 1 4 5

1 3 5 1 9 2 5 4

1 5 4 6 5 4

1 1 3 5 4 9 6 5 4 2

1 1 2 9 6 5 5 4 43

Page 16: Sorting 1. Insertion Sort 3 1 4 4 5 6 2 9 5 1 3 1 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 3 4 4 5 6 2 9 5 1 1 1 3 4 5 6 2 9 5 4 1 1 3 4 5 6 2 9 5 4 1 1 3

4 1

Optimal Sorting Algorithms6. Quicksort. Partitioning Phase

5 3 2 1011 4 1 6 7 9 8

5 3 2 1011 4 1 6 7 9 8

Pivot

5 3 2 1011 9 1 6 7 4 8

5 3 2 1011 9 1 6 7 4 8

5 3 2 1011 9 1 6 7 4 8

5 3 2 1011 9 7 6 1 4 8

5 3 2 1011 9 7 6 8