Python实现插入排序

来源：互联网发布：舒缦水暖床垫淘宝网编辑：程序博客网时间：2024/06/05 06:43

函数形式：

def insertionsort(nums):        #try:    for i in range(1,len(nums)):            #print i        key=nums[i]            #print key        j=i-1            #print j            #print nums[j]        while (j >=0) & (nums[j] >key):               #print nums[j]                #print j            nums[j+1]=nums[j]                #print nums[j+1]            j=j-1                #print nums        nums[j+1]=key            #print nums[j+1]            #return nums            #print nums[j+1]            #print nums[j+1]            #print nums        #except:            #pass    return nums

类的形式：

class Solution(object):    def insertionsort(self,nums):        try:            for i in range(1,len(nums)):                key=nums[i]                j=i-1                while (j >=0) & (nums[j] >key):                    nums[j+1]=nums[j]                    j=j-1                                nums[j+1]=key            return nums        except:            passa=Solution()print a.insertionsort([4555,54,5,54,7,6,7])

阅读全文

0 0