Classic Mergesort

• Two sorted arrays can be merged into one sorted array very quickly in time O(n + m) where n and m are the sizes of the arrays.

1

5

10

14

20

25

29

27

4

8

9

15

17

26

31

30

1

4

5

8

9

10

Previous slide

Next slide

Back to first slide

View graphic version