public class BuddleSort {
/**
* 冒泡排序算法
* @author Jason Shieh
* @param orientNumbers
* @return
*/
public static int[] sort(int[] orientNumbers){
if(orientNumbers == null || orientNumbers.length == 0){
return orientNumbers;
}
int temp;
int last = orientNumbers.length - 1;
while(last > 1){// 从后往前逐步冒泡,直到剩最前面两个数为止
for(int i = 0; i < last; i ++){
if(orientNumbers[i] > orientNumbers[i + 1]){
// 相邻的两个数比较,小的放前面,大的放后面,一趟完成后,最大的就会冒泡至数组尾部
temp = orientNumbers[i];
orientNumbers[i] = orientNumbers[i + 1];
orientNumbers[i + 1] = temp;
}
}
last --;
}
return orientNumbers;
}
public static void main(String[] args) {
int[] myNumbers = {13, 1231, 56, 34, 546, 31, 1, 4, 4465, 464};
int[] numberSorted = BuddleSort.sort(myNumbers);
for(int i = 0; i < numberSorted.length; i ++){
System.out.println(numberSorted[i]);
}
System.out.println("length orient:" + myNumbers.length);
System.out.println("length now:" + numberSorted.length);
}
}
冒泡排序算法(JAVA)
最新推荐文章于 2015-04-27 10:35:50 发布