Python：冒泡排序

最新推荐文章于 2024-08-14 09:22:13 发布

feihongInk

最新推荐文章于 2024-08-14 09:22:13 发布

阅读量632

点赞数 1

分类专栏： Python 文章标签： python 冒泡排序

本文链接：https://blog.csdn.net/feihongInk/article/details/50449941

版权

Python 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

#-*- coding:utf-8 -*-
#冒泡排序
'''This programe is used to sort a series of numbers from little to big'''
def bubbleSort(numbers):
    for j in range(len(numbers)-1,-1,-1):#loop times
        for i in range(j):#
            if numbers[i]>numbers[i+1]:
                numbers[i],numbers[i+1] = numbers[i+1],numbers[i]
    return numbers
    print "----------------------------------------------"


#测试
numbers = [9,8,7,6,5,4,3,2,1,32,43,21,765,0,21,76,32,652,333]
#print the original numbers.
print 'numbers is :',numbers
print 'After sorted:',bubbleSort(numbers)
print len(numbers)
print range(len(numbers)-1,-1,-1)

运行结果：

numbers is : [9, 8, 7, 6, 5, 4, 3, 2, 1, 32, 43, 21, 765, 0, 21, 76, 32, 652, 333]
After sorted: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 21, 21, 32, 32, 43, 76, 333, 652, 765]
19
[18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0]