2.1 Merge Sort

Question 1

How does a merge sort work?

Answer 1

• Uses a divide and conquer method
• Creates two or more identical sub-problems from the largest problem. solving them individually
• Combines their solutions to solve the bigger problems
• Data set is repeatedly split in half until each item is in its own list
• Adjacent lists are then merged back together

Question 2

what are the features of a merge sort?

Answer 2

• Works very well for large data sets
• A very efficient method of performing a sort