Jul 22, 2015
Selection Sort
Selection Sort
Introduction:
In selection sort the list is divided into two sub-lists sorted and unsorted. These two lists are divided by imaginary wall. We find a smallest element from unsorted sub-list and swap it to the beginning. And the wall moves one element ahead, as the sorted list is increases and unsorted list is decreases.
Assume that we have a list on n elements. By applying selection…
View On WordPress