常见算法学习及其Java实现--冒泡算法实现

package org.bupt.test;

import java.util.ArrayList;

class MyResource {
ArrayList<Integer> arrList= new ArrayList<Integer>();
public MyResource(ArrayList<Integer> arrList) {
this.arrList = arrList;
}

public void insertionSort() {
boolean conFlag = true;
for (int i = 0; i < arrList.size(); i++) {
while (conFlag) {//每趟比较前先判断上次比较是不是没有互换动作发生，若是则说明剩下没有排的已经满足顺序
conFlag =false;
for (int j = 0; j < arrList.size()-i-1; j++) {
if (arrList.get(j)<arrList.get(j+1)) {
int temp = arrList.get(j);
arrList.set(j, arrList.get(j+1));
arrList.set(j+1, temp);
conFlag = true;
}
}
for (int j = 0; j < arrList.size(); j++) {
System.out.print(arrList.get(j)+" ");
}
System.out.println("");
}
}
}

public void printOut() {
for (int i = 0; i < 9; i++) {
System.out.print(arrList.get(i)+" ");
}
}
}

public class Main {
public static void main(String args[]) throws Exception {
ArrayList<Integer> arrList = new ArrayList<Integer>();

for (int i = 0; i < 9; i++) {
arrList.add(new Integer((int) (Math.random()*100)));
System.out.print(arrList.get(i)+" ");
}
System.out.println("");

MyResource mtMyResource = new MyResource(arrList);

mtMyResource.insertionSort();

mtMyResource.printOut();

}
}