Python implementation of eight sorting algorithms (eight) simple selection sorting

Code:

#Coding:utf-8#Author: Xubling#L = [6, 3, 2, 32, 5, 4]defSelect_sort (L): forIinchRange (0,len (L)): forJinchRange (I,len (L)):ifL[i] > L[j]:#form of the Daleitai                #temp = l[i]                #L[i] = l[j]                #L[j] = temp                #L[I],L[J] =L[j],l[i]returnLPrintSelect_sort (L)

This algorithm is simpler, remember three words: Daleitai.

Time complexity O (n * * 2)

Space complexity O (1)

An unstable algorithm.

Remember four stable sorting algorithms: Direct insert sort, bubble sort, two-way merge sort, base sort. The rest is unstable.

Python implementation of eight sorting algorithms (eight) simple selection sorting