/**
* 冒泡排序算法
* @author WangZhen
*/
package test;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Random;
import java.util.Set;
public class BubbleSort {
public static void main(String[] args) {
Random random = new Random();
Set<Integer> set = new HashSet<Integer>();
while (set.size()<100){
set.add(random.nextInt(100));
}
System.out.println("生成1到100个不重复的数:");
for (Iterator<Integer> it = set.iterator(); it.hasNext();){
System.out.print(it.next() + ", ");
}
Integer[] values = (Integer[])set.toArray(new Integer[set.size()]);
System.out.println("\n升序冒泡排序算法:");
sortAsc(values);
for (Integer i : values){
System.out.print(i + ", ");
}
System.out.println("\n降序冒泡排序算法:");
sortDesc(values);
for (Integer i : values){
System.out.print(i + ", ");
}
}
public static void sortAsc(Integer[] values) {
for (int i = 0; i < values.length; ++i) {
for (int j = 0; j < values.length - i - 1; ++j) {
if (values[j] > values[j + 1]) {
int temp = values[j];
values[j] = values[j + 1];
values[j + 1] = temp;
}
}
}
}
public static void sortDesc(Integer[] values) {
for (int i = 0; i < values.length; ++i) {
for (int j = 0; j < values.length - i - 1; ++j) {
if (values[j] <= values[j + 1]) {
int temp = values[j];
values[j] = values[j + 1];
values[j + 1] = temp;
}
}
}
}
}