Selection Sort

The selection sort technique is based upon the extension of the minimum \maximum technique. By means of a nest of for loops, a pass through the array is made to locate the minimum value. Once this found it is placed in the first position of the array (position 0). Another remaining element is made to find the next smallest element which is placed in the second position (position 1) and so on. Once the next to last element is compared with the last element all the elements have been sorted into ascending order.

Analysis of Selection Sort

The first pass required (n-1) comparisions to find the location loc of find the location loc of smallest element, the second pass required (n-2) .... K^th pass requires (n-k) and the lost requires only one comparison. Total no. of comparisons are

                        = (n-1) + (n-2) + (n-3) + .... + (n-k) +3+2+1

                        = n (n-1)/2

                        = 0 (n²).                                        

Data Structure & Algorithms Assignment Help, Live Experts

Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.

ExpertsMind.com - Selection Sort Assignment Help, Selection Sort Homework Help, Selection Sort Assignment Tutors, Selection Sort Solutions, Selection Sort Answers, Sorting Assignment Tutors