Can you explain the difference between insertion sort, quicksort, and merge sort? When would you choose one over another?

Sample answer preview

These three sorting algorithms have different characteristics and use cases. Insertion sort traverses the array and inserts each element in its correct position in the already sorted portion.