Select sort and Python implementations

1. Algorithmic thinking

n elements, assuming that the first I element is already ordered, the smallest element from i+1 to n elements is placed in its final position in the ordered table

2. Code implementation

(1) Non-recursive calls

defSelectionsort (A, N): forIinchRange (0, n-2): Mini=I forJinchRange (i+1, N):ifA[J] <A[mini]: I=J A[i],a[mini]= A[mini], a[i]#Swap        PrintAif __name__=='__main__': A= [6,5,4,3,2,1] Selectionsort (A, Len (a))PrintA

(2) Recursive invocation

defSelectionsort (A, K, n):if(k = = N):returnMini=k forJinchRange (k, n):ifA[J] <A[mini]: Mini=J A[k],a[mini]= A[mini], a[k]#Swap            Printa Selectionsort (A, K+1, N)if __name__=='__main__': A= [6,5,4,3,2,1] Selectionsort (A, 0, Len (a))PrintA

3. Complexity of Time

For any input, the selection sort is an O (n^2) algorithm.

Select sort and Python implementations