Python算法-冒泡排序

#coding:utf-8
"""
冒泡排序
原理：依次重复访问每一个需要排序的元素，每次比较相邻的两个元素是否符合顺序，若不符合就交换，直到没有不符合顺序的为止。
"""
def bubble_sort(para_list, ordered = True):
    ‘‘‘ ‘‘‘
    len_para_list = len(para_list)
    assert len_para_list >= 2
    for i in range(len_para_list - 1, 0, -1):
        for j in range(i):
            if para_list[j] > para_list[j + 1] and ordered:
                para_list[j], para_list[j + 1] = para_list[j + 1], para_list[j]
            elif para_list[j] < para_list[j + 1] and not ordered:
                para_list[j], para_list[j + 1] = para_list[j + 1], para_list[j]
    return para_list



if __name__ == ‘__main__‘:
    import numpy as np
    arr = np.array([1,2,4,5,3,7,2,1,9])
    arr_order = bubble_sort(arr, False)
    print arr_order