【算法基础】冒泡排序

 python实现

import random

def bsort(slist):
    len_slist = len(slist)
    trytimes = len_slist-1
    
    for i in range(len_slist-1):
        flag = True
        for j in range(trytimes):
            if slist[j] > slist[j+1]:
                slist[j], slist[j+1] = slist[j+1], slist[j]
                flag = False

        trytimes -= 1
        if flag:
            break
    return slist

a = [random.randint(200,900) for x in range(10)]
print(bsort(a))

java实现

public static int[] bsort(int[] array){
    int array_len = array.length;
    int trytimes = array_len -1;
    
    for (int i=0; i< array_len-1; i++){
        boolean flag = true;
        for (int j = 0;j< trytimes;j++ ) {
            if (array[j] > array[j+1]){
                int temp = array[j];
                array[j] = array[j+1];
                array[j+1] = temp;
                flag = false;
            }
        }
        trytimes -= 1;
        if(flag){
            break;
        }
    }
    return array;

}