Comparing Merge Sort And Bubble Sort Algorithms Aqa

Merge sort

• Suitable for large datasets

• Performs well no matter how unorganised the data is

• Uses a lot of memory

• More complex to implement

Bubble sort

• Simple to understand and implement

• Slow for large datasets

• Inefficient, as it iterates through the data multiple times