1.比较排序之冒泡排序

 1 package com.algorithm.sort.bubble;
 2 
 3 import java.util.Arrays;
 4 
 5 /**
 6  * 冒泡排序
 7  * Created by yulinfeng on 6/19/17.
 8  */
 9 public class Bubble {
10     public static void main(String[] args) {
11         int[] nums = {10, 2, 11, 8, 7};
12         nums = bubbleSort(nums);
13         System.out.println(Arrays.toString(nums));
14     }
15 
16     /**
17      * 冒泡排序
18      * @param nums 待排序数字序列
19      * @return 排好序的数字序列
20      */
21     private static int[] bubbleSort(int[] nums) {
22 
23         for (int i = 0; i ) {
24             for (int j = 0; j ) {
25                 if (nums[j] > nums[j + 1]) {
26                     int temp = nums[j];
27                     nums[j] = nums[j + 1];
28                     nums[j + 1] = temp;
29                 }
30             }
31         }
32 
33         return nums;
34     }
35 }

 1 #冒泡排序
 2 def bubble_sort(nums):
 3     for i in range(len(nums)):
 4         for j in range(len(nums) - i - 1):
 5             if nums[j] > nums[j + 1]:
 6                 temp = nums[j]
 7                 nums[j] = nums[j + 1]
 8                 nums[j + 1] = temp
 9     
10     return nums
11 
12 nums = [10, 2, 11, 8, 7]
13 nums = bubble_sort(nums)
14 print(nums)