代码每日一练-------2019.9.5

写一个冒泡排序 java+Python

for(int i=0;i<arr.length;i++){
      for(int j=0;j<arr.length-i-1;j++){
            if(arr[j]>arr[j+1]){
                temp t=arr[j];
                arr[j]=arr[j+1];
                arr[j+1]=t;
}
}
}

# python版冒泡排序
def caclu(nums):
    for i in range(len(nums)-1):
        for j in range(len(nums)-i-1):
            if nums[j] > nums[j+1]:
                nums[j], nums[j+1] = nums[j+1], nums[j]
    return nums


nums = [1, 3, 7, 5, 10, 34, 20]
print(caclu(nums))