/*
* @(#)bubbleSort.java 1.01 09/11/24
*
* Copyright 2009 Three Stone.company, Inc. All rights reserved.
* PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
* this function implement as(-9 -4 0 7 4 -2 0 3 8)to(-9 -4 -2 3 4 7 8 0 0)sort code.
*/
package edu.sort;
public class bubbleSort {
/**
* @see
* @param args
* @author GL
* @category:實(shí)現(xiàn)隨機(jī)給出帶有正負(fù)整數(shù)的數(shù)組由小到大的排序（負(fù)數(shù)->正數(shù)->0）
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int array[] = new int[20];//初始化數(shù)組
for (int i = 0; i < array.length; i++) {
int number = (int) (Math.random() * 10 * (Math.pow(-1, (int) (Math
.random() * 10))));//初始化隨機(jī)正負(fù)數(shù)
array[i] = number;
}
System.out.println("初始序列為：");
printNumbers(array);
array = bubble(array);//排序方法調(diào)入
System.out.println("最后的排序?yàn)椋?/span>");
printNumbers(array);
}
/**
* @param array[]
* @author GL
* @category 冒泡排序并將所有0置后
*/
public static int[] bubble(int array[]) {
int length = array.length;
for (int i = 0; i < length; i++) {
for (int j = length - 1; j > i; j--) {
if (array[j] < array[j - 1]) {//冒泡原理"大小"換成"小大"
int temp = array[j];
array[j] = array[j - 1];
array[j - 1] = temp;
}
}
}
System.out.println("冒泡排序結(jié)果為：");
printNumbers(array);
int count = 0;//記錄數(shù)組中0的個(gè)數(shù)
int start = 0;//記錄0在數(shù)組中的初始出現(xiàn)位置
for (int i = 0; i < array.length; i++) {
if (array[i] == 0 && array[i - 1] != 0) {
start = i + 1;
count = 1;
System.out.println("第" + start + "位出現(xiàn)0");
} else if (array[i] == 0 && array[i - 1] == 0) {
count++;
}
}
System.out.println("0的個(gè)數(shù)為：" + count + "個(gè)");
if (start != 0 && count != 0) {//按照0的初始出現(xiàn)位置與0的個(gè)數(shù)順次移動(dòng)元素
for (int i = (start - 1); i < array.length; i++) {
if (i < (array.length - count)) {
array[i] = array[i + count];
} else { //最后將數(shù)組后count位置0
array[i] = 0;
}
}
}
return array;
}
/**
* @param array[]
* @author GL
* @category 輸出情況討論
*/
public static void printNumbers(int array[]) {
for (int i = 0; i < array.length; i++) {
if ((((i + 1) % 10) == 1) && array[i] >= 0) {//首位
System.out.print(" " + array[i] + " ");
} else if ((i + 1) % 10 != 0 && array[i + 1] < 0) {//非尾負(fù)數(shù)
System.out.print(array[i] + " ");
} else if ((i + 1) % 10 != 0 && array[i + 1] >= 0) {//非尾正數(shù)
System.out.print(array[i] + " ");
} else {
System.out.println(array[i]);//尾數(shù)
}
}
}
}