如何计算冒泡时间

时间:2018-04-30 00:42:41

标签: python sorting

我不确定如何计算这样的冒泡,任何输入都是   不胜感激!此外,我希望能够“打印”分拣后几秒钟的打印时间。此外,欢迎任何关于代码本身的评论!

    def bubbleSort(list):
        needNextPass = True

        k = 1
        while k < len(list) and needNextPass:
            # List may be sorted and next pass not needed
            needNextPass = False
            for i in range(len(list) - k): 
                if list[i] > list[i + 1]:
                    # swap list[i] with list[i + 1]
                    temp = list[i]
                    list[i] = list[i + 1]
                    list[i + 1] = temp

                    needNextPass = True # Next pass still needed

    # A test method 
    def main():
        list = [5000, 200000, 250000, 10000, 150000, 300000]
        bubbleSort(list)
        for v in list:
            print("Bubble sort list: ",v, end = ",")




    main()

1 个答案:

答案 0 :(得分:1)

import time

def bubble_sort(list):

  # Implementation of bubble sort

  return list

#------------------------------------

def main():

  l = [1,5,7,6,8]

  start_time = time.time()

  bubble_sort(l)

  stop_time = time.time()

  duration = stop_time - start_time()

#------------------------------------

main()