用python实现算法之——选择排序

class SelectionSort:    def selectionSort(self, A, n):        for i in range(0,n):            min = A[i]            num = i            for j in range(i+1,n):                if min>A[j]:                    min=A[j]                    num = j            if num!=i:                A[i],A[num]=A[num],A[i]    return As=SelectionSort()print s.selectionSort([54,35,48,36,27,12,44,44,8,14,26,17,28],13)