Python data structures and Algorithms Nineth Day "select Sort"

1. Select the principle of sorting

2. Code implementation

defSelection_sort (alist): N=Len (alist)#requires a n-1 selection operation     forIinchRange (n-1):        #Record minimum positionMin_index =I#Select the minimum data from the i+1 position to the end         forJinchRange (i+1, N):ifALIST[J] <Alist[min_index]: Min_index=J#If the selected data is not in the correct location, swap        ifMin_index! =I:alist[i], Alist[min_index]=Alist[min_index], alist[i]alist= [54,226,93,17,77,31,44,55,20]selection_sort (alist)Print(alist)

3. Complexity of Time

Optimal time complexity: O (n2)

Worst time complexity: O (n2)

Stability: Unstable (consider ascending each time to select the maximum case)

Python data structures and Algorithms Nineth Day "select Sort"