java使用冒泡法排序

public class Insertion {
int [] test ={2,3,2,5,7,11};
public static void main(String [] args){//主方法为静态方法，使用实例变量需要创建对象引用。
	int middle_number = 0;
	Insertion start = new Insertion();
	for(int a=0; a start.test[b+1]){
			middle_number = start.test[b+1];
			start.test[b+1] = start.test[b];
			start.test[b] = middle_number;
			}
		}
	}
	for(int c=0; c