您的位置:首页 > 编程语言 > Python开发

快速排序python实现

2015-08-28 10:29 681 查看
#--×--coding:utf-8-*-

def main():

  nlist = []

  while 1:

    tmp = raw_input("Please input your element,end by -1")
if int(tmp ) == -1:
break
nlist.append(tmp)

InsertSort(nlist)

def InsertSort(nlist):
nlistSize = len(nlist)
for index in xrange(nlistSize - 1):
for currentindex  in xrange(index, nlistSize - 1):
if nlist[currentindex] > nlist[currentindex + 1]:
nlist[currentindex] , nlist[currentindex + 1]  = nlist[currentindex +1] > nlist[currentindex]

print "排序后的",nlist

if __name__ == "__main__":
main()


      
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: