Context

Sorting is a core building block in coding interviews and production systems, including ranking and organizing data shown in the One Drop app. Interviewers use this topic to test whether you understand algorithmic trade-offs rather than just memorizing names.

Core Question

Explain the differences between common sorting algorithms such as bubble sort, insertion sort, merge sort, quicksort, and heapsort.

Your answer should cover:

1. Time complexity in best, average, and worst cases
2. Space usage and whether the algorithm is in-place
3. Stability and why it matters
4. When you would choose one algorithm over another

Scope Guidance

You do not need to derive the algorithms from scratch, but you should be able to compare them clearly, explain the main idea behind each one, and discuss practical trade-offs. A strong answer also mentions why some simple algorithms are still useful on small or nearly sorted inputs, and why asymptotically faster algorithms dominate at scale.