Python 实现的"冒泡排序"
发布时间:2020-12-17 17:15:55 所属栏目:Python 来源:网络整理
导读:今天PHP站长网 52php.cn把收集自互联网的代码分享给大家,仅供参考。 ''''' Bubble Sort @author: aihua.sun ''' import string import random number = []; count = 0; def bubbleSort(): #initializeNumberArray(); gen
以下代码由PHP站长网 52php.cn收集自互联网 现在PHP站长网小编把它分享给大家,仅供参考 ''''' Bubble Sort @author: aihua.sun ''' import string import random number = []; count = 0; def bubbleSort(): #initializeNumberArray(); generateRandomNumberArray(10,1,300); showArray(); sort(); showArray(); def showArray(): print(number); #Manual input number def initializeNumberArray(): print("Please input array of integer,and input Q will get sort of result!"); while True: inputCommand = input("input a number:"); if inputCommand != "Q": #must indicator count is global variable global count; count += 1; number.append(inputCommand); else: break; #automatic generate random number array def generateRandomNumberArray(lenght,minNumber,maxNumber): #must indicator count is global variable global count; for index in range(lenght): number.append(random.randrange(minNumber,maxNumber)); count = index; def sort(): for reverseIndex in range(count - 2,-1): for index in range(reverseIndex): behindIndex = index + 1; if needSwap(number[index],number[behindIndex]): swapByIndex(index,behindIndex); def needSwap(previousNumber,behindNumber): return int(previousNumber) > int(behindNumber); def swapByIndex(previousNumber,behindNumber): number[previousNumber],number[behindNumber] = number[behindNumber],number[previousNumber]; if __name__ == "__main__": bubbleSort(); 以上内容由PHP站长网【52php.cn】收集整理供大家参考研究 如果以上内容对您有帮助,欢迎收藏、点赞、推荐、分享。 (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |