加入收藏 | 设为首页 | 会员中心 | 我要投稿 江门站长网 (https://www.0750zz.com/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 教程 > 正文

Python 达成的“冒泡排序”

发布时间:2021-11-21 21:23:51 所属栏目:教程 来源:互联网
导读:Python 实现的冒泡排序 Bubble Sort @author: aihua.sun import string import random number = []; count = 0; def bubbleSort(): #initializeNumberArray(); generateRandomNumberArray(10, 1, 300); showArray(); sort(); showArray(); def showArray(): p
Python 实现的"冒泡排序"
 
'''
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, 0, -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();

(编辑:江门站长网)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

    热点阅读