Are Selection or Insertion sort useful outside of academic environments?

Question

Do these sorting algorithms have any use in real world application?

Or is it just a basic example of sorting algorithm with n^2 complexity?

Can anyone give some example of its usage?

Answer 1

Insertion sort is one of the fastest sorting algorithm for sorting very small arrays.

In practice, many quicksort / mergesort implementations stop when the subarrays to sort is below certain threshold, and insertion sort is then used for these small arrays.

---

Selection sort is rarely used in practice.