面试必备 - 经典冒泡排序Java

冒泡排序的原理就是

每个元素一轮一轮的去与相邻的元素作比较，

附上源码

public class test1 {static String[] unsorted = {"B","C","A","F","E","H","G"};public static void main(String[] args){int i,j;String temp;int len = unsorted.length;for (i=0;i<len-1;i++){for (j=i+1;j<len;j++){if (unsorted[i].compareTo(unsorted[j]) > 0){temp = unsorted[i];unsorted[i]=unsorted[j];unsorted[j]=temp;}}}System.out.println("Result is");for (i=0;i<len;i++){System.out.print(unsorted[i] + ',');}}}