Select Sort--python Implementation

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:

1 #selection_sort.py2 defSelection_sort (arr):3Count =Len (arr)4      forIinchRange (count-1):#Exchange n-1 times5Min =I6         #Find the minimum number7          forJinchRange (I, count):8             ifArr[min] >Arr[j]:9Min =JTenArr[min], arr[i] = Arr[i], arr[min]#Exchange One     returnarr A  -My_list = [6, 23, 2, 54, 12, 6, 8, 100] - Print(Selection_sort (My_list))

Select Sort--python Implementation