work025.java
package test02;
public class work025
{
public static void main(String[] args)
{
//冒泡排序
int myArray[] = new int[]{63,4,24,1,3,15};
work025 w1 = new work025();
w1.sort(myArray);
}
//排序的方法
public void sort(int[] array)
{
for (int i = 0; i < array.length; i++)
{
for (int j = 0; j < array.length -1; j++)
{
if(array[j] > array[j+1])
{
int temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
}
}
}
showArray(array);
}
//显示数组
public void showArray(int[] array)
{
for (int i : array)
{
System.out.print("<" + i);
}
System.out.println();
}
}