In this example we are going to sort the values of an array using selection sort.
In selection sorting algorithm,
find the minimum value in the array then swap it first position. In next
step leave the first value and find the minimum value within remaining values.
Then swap it with the value of minimum index position. Sort the
remaining values by using same steps. Selection sort is probably the most intuitive sorting algorithm to invent.
The complexity of selection sort algorithm is in worst-case, average-case, and best-case run-time of Θ(n2), assuming that comparisons can be done in constant time.
In selection sort algorithm to find the
minimum value in the array. First assign minimum index in key (index_of_min=x).
find the minimum value and assign the index of minimum value in key
(index_of_min=y). Then swap the minimum value with the value of minimum
At next iteration leave the value of minimum index position and sort the remaining values by following same steps.
Working of the selection sort :
Say we have an array unsorted A,A,A................ A[n-1] and A[n] as input. Then the following steps are followed by
selection sort algorithm to sort the values of an array . (Say we have a
key index_of_min that indicate the position of minimum value)
1.Initaily varaible index_of_min=0;
2.Find the minimum value in the unsorted array.
3.Assign the index of the minimum value into index_of_min variable.
4.Swap minimum value to first position.
5.Sort the remaining values of array (excluding the first value).
The code of the program :
Output of the example:
Values Before the sort:
12 9 4 99 120 1 3 10 Values after the sort: 120 99 12 10 9 4 3 1 PAUSE
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions.