Selection method is also a sort of entry algorithm, compared to the bubbling method, its method is a bit more ingenious, its starting point is "pick", each time the selection of the array of the most value, and the predecessor element transposition, and then continue to pick the remaining elements of the maximum value and repeat the operation. Individuals think that the choice of sorting is not in the order itself, but in the selection and replacement of the method, for some problems are very helpful.
Select Sort:
Select sort (Selection sort) is a simple and intuitive sorting algorithm. It works as follows. First find the smallest (large) element in the unordered sequence, place it at the beginning of the sort sequence, and then continue looking for the smallest (large) element from the remaining unsorted elements, and place it at the end of the sorted sequence. And so on until all elements are sorted. The main advantages of selecting a sort are related to data movement. If an element is in the correct final position, it will not be moved. Select sort every time a pair of elements is exchanged, at least one of them will be moved to its final position, so the table of n elements is sorted for a total of up to n-1 times. In all of the sorting methods that rely entirely on swapping to move elements, choosing a sort is a very good one.
Python implementations:
# selection_sort.py def selection_sort (arr): count = Len (arr) for I in range (count-1): # swap n-1 times min = i< c4/># Find minimum for J in range (I, count): if arr[min] > Arr[j]: min = j Arr[min], arr[i] = Arr[i], arr[min]< c9/># Interchange return arr my_list = [6, 2, 6, 8, +] Print (Selection_sort (my_list))