4.3.5 Sorting Algorithms

Question 1

Which Sorting Algorithm is more efficient :
Bubble or Merge

Answer 1

Merge Sort

Merge has O ( n log n) Bubble is O (1) best case and O (n^2) worst case

Question 2

Divide and Conquer Algorithm?

Answer 2

Merge Sort

Question 3

Time Complexity of Bubble Sort?

Answer 3

O ( 1 ) Best case
O ( n^2 ) Worst case

Question 4

What is the time complexity of Merge Sort?

Answer 4

O ( n log n )

Question 5

Sort this array into ascending order using bubble :
4 3 5 7 6

Answer 5

1. (4 3) 5 7 6
2. 3 (4 5) 7 6
3. 3 4 (5 7) 6
4. 3 4 5 (7 6)
5. (3 4) 5 6 7
6. 3 (4 5) 6 7
7. 3 4 (5 6) 7
8. 3 4 5 (6 7)

brackets show switches/checks

Question 6

Sort this array into ascending order using merge:
Tom Sue Jack Bill Ada

Answer 6

1. Tom Sue Jack Bill Ada
2. Tom Sue Jack | Bill Ada
3. Jack Sue Tom | Ada Bill
4. Ada Bill Jack Sue Tom