3.1.4 - Sorting algorithms

Question 1

Bubble sort

Answer 1

A bubble sort repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. This process continues until the list is sorted

Question 2

Merge sort

Answer 2

A merge sort divides the list into halves, repeatedly sorts each half, and then merges the sorted halves back together to form a sorted list.

Question 3

What are the advantages of a bubble sort?

Answer 3

Simple to understand and implement
Does not require additional memory

Question 4

What are the disadvantages of a bubble sort?

Answer 4

Inefficient for large lists
Inefficient (slow) for large, unsorted datasets

Question 5

What are the advantages of a merge sort?

Answer 5

Efficient (fast) for large, sorted lists

Question 6

What are the disadvantages of a merge sort?

Answer 6

More complex to implement
Requires additional memory for the temporary arrays

Question 7

When is a bubble sort more appropriate than a merge sort?

Answer 7

When working with small or nearly sorted datasets
Better for simpler datasets

Question 8

When is a merge sort more appropriate than a bubble sort?

Answer 8

When dealing with large datasets where efficiency is crucial.