java冒泡排序

package com.t48.action;

public class SortDemo {

public static void main(String[] args) {

System.out.println("我在测试");
int []m = new int[]{1,2,5,7,8,22,8,3,21,0,30,44,21,62,698,52};


//冒泡排序 n次比较,n 次交换
long start = System.currentTimeMillis();
System.out.println(start);
int temp;
for (int i=0;i< m.length -1;i++) {

for(int in =0 ;in<m.length -1;in++){

if(m[in]<m[in+1])
{
temp =m[in];
m[in] = m[in+1];
m[in +1] =temp;
}

}
}
System.out.println(System.currentTimeMillis()-start);

for (int i = 0; i < m.length; i++) {
System.out.println(m[i]);
}

}
}