冒泡法排序 Bobble Sort

自已写的：

import argparse

parser = argparse.ArgumentParser('BubbleShort')
parser.add_argument('nums', nargs='+', type=int)
args = parser.parse_args()
print args.nums

length = len(args.nums)
i= length
for i in xrange(0, length-1):
    for j in xrange(0, length-1-i):
        if args.nums[j] > args.nums[j+1]:
            temp = args.nums[j]
            args.nums[j] = args.nums[j+1]
            args.nums[j+1] = temp

print args.nums

import argparse

parser = argparse.ArgumentParser('BubbleShort')

parser.add_argument('nums', nargs='+', type=int)

args = parser.parse_args()

print args.nums

length = len(args.nums)

i= length

for i in xrange(0, length-1):

for j in xrange(0, length-1-i):

if args.nums[j] > args.nums[j+1]:

temp = args.nums[j]

args.nums[j] = args.nums[j+1]

args.nums[j+1] = temp

print args.nums

参考wiki写的，终于知道什么叫优雅了：

import argparse

parser = argparse.ArgumentParser('BubbleShort')
parser.add_argument('nums', nargs='+', type=int)
args = parser.parse_args()
print args.nums

def bobbleSort(List):
    for i in xrange(len(List)-1, 0, -1):
        for j in xrange(0, i):
            if List[j] > List[j+1]:
                List[j], List[j+1] = List[j+1],List[j]
    return List

print bobbleSort(args.nums)

import argparse

parser = argparse.ArgumentParser('BubbleShort')

parser.add_argument('nums', nargs='+', type=int)

args = parser.parse_args()

print args.nums

def bobbleSort(List):

for i in xrange(len(List)-1, 0, -1):

for j in xrange(0, i):

if List[j] > List[j+1]:

List[j], List[j+1] = List[j+1],List[j]

return List

print bobbleSort(args.nums)

https://github.com/allenmo/python_study/blob/master/046_bubble_sort.py

https://github.com/allenmo/python_study/blob/master/047_bubble_sort_2.py

Post Views: 2,078