python(三)6种排序算法性能比较(冒泡、选择、插入、希尔、快速、归并)

# coding:utf-8

import random
import time

def bubble_sort(alist):
    """冒泡"""
    n = len(alist)
    for j in range(n-1):
        count = 0
        for i in range(0, n-1-j):
            if alist[i] > alist[i+1]:
                alist[i],alist[i+1] = alist[i+1], alist[i]
                count += 1
        if 0 == count:
            return

def select_sort(alist):
    """选择"""
    n = len(alist)
    for j in range(n-1):
        min_index = j
        for i in range(j+1, n):
            if alist[min_index] > alist[i]:
                min_index = i
        alist[j], alist[min_index] = alist[min_index], alist[j]

def insert_sort(alist):
    """插入"""
    n = len(alist)
    for j in range(1, n):
        i = j
        while i > 0:
            if alist[i] < alist[i-1]:
                alist[i], alist[i-1] =
  • 0
    点赞
  • 4
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
好的,下面是使用Python实现7排序算法对1000以内的270个随机数进行排序的代码: ```python import random # 生成270个1000以内的随机数 nums = [random.randint(0, 1000) for _ in range(270)] # 冒泡排序 def bubble_sort(nums): n = len(nums) for i in range(n): for j in range(n - i - 1): if nums[j] > nums[j + 1]: nums[j], nums[j + 1] = nums[j + 1], nums[j] return nums # 选择排序 def selection_sort(nums): n = len(nums) for i in range(n): min_index = i for j in range(i + 1, n): if nums[j] < nums[min_index]: min_index = j nums[i], nums[min_index] = nums[min_index], nums[i] return nums # 插入排序 def insertion_sort(nums): n = len(nums) for i in range(1, n): j = i while j > 0 and nums[j] < nums[j - 1]: nums[j], nums[j - 1] = nums[j - 1], nums[j] j -= 1 return nums # 希尔排序 def shell_sort(nums): n = len(nums) gap = n // 2 while gap > 0: for i in range(gap, n): temp = nums[i] j = i while j >= gap and nums[j - gap] > temp: nums[j] = nums[j - gap] j -= gap nums[j] = temp gap //= 2 return nums # 归并排序 def merge_sort(nums): if len(nums) <= 1: return nums mid = len(nums) // 2 left = merge_sort(nums[:mid]) right = merge_sort(nums[mid:]) return merge(left, right) def merge(left, right): result = [] i = j = 0 while i < len(left) and j < len(right): if left[i] < right[j]: result.append(left[i]) i += 1 else: result.append(right[j]) j += 1 result += left[i:] result += right[j:] return result # 快速排序 def quick_sort(nums): if len(nums) <= 1: return nums pivot = nums[0] left = [x for x in nums[1:] if x < pivot] right = [x for x in nums[1:] if x >= pivot] return quick_sort(left) + [pivot] + quick_sort(right) # 堆排序 def heap_sort(nums): def sift_down(nums, start, end): root = start while True: child = 2 * root + 1 if child > end: break if child + 1 <= end and nums[child] < nums[child + 1]: child += 1 if nums[root] < nums[child]: nums[root], nums[child] = nums[child], nums[root] root = child else: break n = len(nums) for i in range(n // 2 - 1, -1, -1): sift_down(nums, i, n - 1) for i in range(n - 1, 0, -1): nums[0], nums[i] = nums[i], nums[0] sift_down(nums, 0, i - 1) return nums # 输出排序结果 print("冒泡排序结果:", bubble_sort(nums)) print("选择排序结果:", selection_sort(nums)) print("插入排序结果:", insertion_sort(nums)) print("希尔排序结果:", shell_sort(nums)) print("归并排序结果:", merge_sort(nums)) print("快速排序结果:", quick_sort(nums)) print("堆排序结果:", heap_sort(nums)) ``` 注意:以上代码实现了7排序算法,但是对于乱序数组的排序效率并不相同,具体哪排序算法更适合哪排序情况需要根据实际情况具体分析。
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值