3.1.4 Sorting Algorithms

Question 1

How does the merge sort Algorithm work

Answer 1

It takes 2 parts pieces of data and checks to see which is bigger and arranges them, this is repeated as the list goes on

Question 2

How does the bubble sort Algorithm work

Answer 2

Examines each set of data tat is adjacent in the string switching positions f they are out of order

Question 3

Advantages of Bubble sort

Answer 3

Efficient is smaller and/or ordered databases

Question 4

Advantages of Merge sort

Answer 4

Merge sort can be used with linked lists without taking up any more space.

Question 5

Disadvantages of Merge sort

Answer 5

For small datasets, merge sort is slower than other sorting algorithms.

Question 6

Disadvantages of Bubble sort

Answer 6

Does not deal well with a list containing a huge number of items