Given that selection is based on keys, selection sort can effectively sort a file with large values with small keys. This sorts an array by repeatedly selecting the first element that is the smallest (in ascending order) from the unsorted portion.
In a given array, the method maintains two subarrays: the already-sorted subarray and the unsorted subarrays made up the remainder.
The least element (ascending order) from the unsorted subarray is chosen and moved to the sorted subarray in each iteration of the selection sort. This process continues. This in-place comparison-based sorting divides the list into two parts, the sorted portion at the left end and the unsorted portion at the right end. The sorted section is originally empty, and the entire list is in the unsorted half.
To learn more about Selection sort click here:
brainly.com/question/13161882
#SPJ4
