InterviewSolution
Saved Bookmarks
| 1. |
Why selection sort is referred to be simplest sorting algorithm in compare with other sorting algorithm? |
|
Answer» 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. |
|