python 排序

最新推荐文章于 2025-07-18 14:35:46 发布

草东

最新推荐文章于 2025-07-18 14:35:46 发布

阅读量194

点赞数 1

CC 4.0 BY-SA版权

分类专栏： python 算法文章标签： python 算法

本文链接：https://blog.youkuaiyun.com/zhang_weiqi/article/details/52201364

python 同时被 2 个专栏收录

4 篇文章

订阅专栏

算法

1 篇文章

订阅专栏

本文通过Python实现并演示了三种经典排序算法：冒泡排序、插入排序和希尔排序。每种算法都详细介绍了其实现过程，并通过生成随机数列表来测试这些排序算法的效果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

排序

#!/usr/bin/env python
#! coding: utf-8

import random

def getrandomdata(num):
    alist = [random.randint(1,1000) for i in range(num)]
    return alist

# Bubble Sort
def bubble(alist):
    length = len(alist)
    for i in range(length-1,0,-1):
        for j in range(i):
            if alist[j] > alist[j+1]:
                alist[j],alist[j+1] = alist[j+1], alist[j]
    return alist

# Insertion Sorting
def insert(alist):
    length = len(alist)
    for i in range(length-1):
        for j in range(i+1,length):
            if alist[i] > alist[j]:
                alist[i], alist[j] = alist[j], alist[i]
    return alist

# Shell sort
def shell(alist):
    length = len(alist)
    dist = length/2
    while dist > 0:
        for i in range(0, dist):
            for j in range(i, length-dist, dist):
                for k in range(j+dist, length, dist):
                    if alist[k] < alist[j]:
                        alist[j], alist[k] = alist[k], alist[j]
        dist = dist/2
    return alist

if __name__ == '__main__':
    num = int(raw_input("Please input the length of list(between 0,10000):"))
    alist = getrandomdata(num)
    bubblelist = bubble(alist)
    alist = getrandomdata(num)
    insertlist= insert(alist)
    alist = getrandomdata(num)
    shelllist = shell(alist)

    print "Bubblelist is ", bubblelist
    print "Insertionlist is ", insertlist
    print "Shelllist is ", shelllist