冒泡排序--python

import random


# 原始冒泡排序
def bubble_sort(nums):
    counter = 0
    for i in range(len(nums) - 1): # 这个循环负责设置冒泡排序的趟数
        for j in range(len(nums) - i - 1): # 这个是每趟比较的次数，每次从0开始，底部是已有序
            if nums[j] > nums[j+1]:
                nums[j], nums[j+1] = nums[j+1], nums[j]
                counter += 1
    print('比较次数:', counter)
    return nums


# 优化冒泡排序
def bubble_sort2(nums):
    counter = 0
    for i in range(len(nums) - 1):
        ex_flag = False # 设置交换标志，如果没有进行交换，说明已排序完成，无需再进行
        for j in range(len(nums) - 1):
            if nums[j] > nums[j+1]:
                nums[j], nums[j+1] = nums[j+1], nums[j]
                counter += 1
                ex_flag = True
        if not ex_flag:
            break
    print('比较次数', counter)
    return nums

def test_arr(count, limit):
    arr = []
    for i in range(count):
        arr.append(random.randint(1, limit))
    return arr


if __name__ == '__main__':
    arr = test_arr(100, 100)
    arr2 = test_arr(100, 100)
    print('冒泡排序前', arr)
    arr = bubble_sort(arr)
    print('冒泡排序后', arr)
    print('--------------------')
    print('冒泡排序前', arr2)
    arr2 = bubble_sort(arr2)
    print('冒泡排序后', arr2)