比较排序之冒泡排序的实现

package com.algorithm.sort.bubble;import java.util.Arrays;/** * 冒泡排序 * Created by yulinfeng on 6/19/17. */public class Bubble {  public static void main(String[] args) {    int[] nums = {10, 2, 11, 8, 7};    nums = bubbleSort(nums);    System.out.println(Arrays.toString(nums));  }  /**   * 冒泡排序   * @param nums 待排序数字序列   * @return 排好序的数字序列   */  private static int[] bubbleSort(int[] nums) {    for (int i = 0; i < nums.length; i++) {      for (int j = 0; j < nums.length - i - 1; j++) {        if (nums[j] > nums[j + 1]) {          int temp = nums[j];          nums[j] = nums[j + 1];          nums[j + 1] = temp;        }      }    }    return nums;  }}

#冒泡排序def bubble_sort(nums):  for i in range(len(nums)):    for j in range(len(nums) - i - 1):      if nums[j] > nums[j + 1]:        temp = nums[j]        nums[j] = nums[j + 1]        nums[j + 1] = temp    return numsnums = [10, 2, 11, 8, 7]nums = bubble_sort(nums)print(nums)