Question

Why selection sort is referred to be simplest sorting algorithm in compare with other sorting algorithm?

Answer 1

hope these helps yah :)

Insertion sort is a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provides several advantages: ... Efficient for small data sets.