冒泡排序
精简冒泡排序算法
public static void main(String[] args)
{
int a[] = {6, 1, 2, 9, 8, 3, 4, 10, 39, 26};
int b;
for (int i = 0; i < a.length - 1; i++)
{
for (int j = i + 1; j < a.length; j++)
{
if (a[j] < a[i])
{
b = a[i];
a[i] = a[j];
a[j] = b;
}
}
}
for (int k = 0; k < a.length; k++)
{
System.out.println(a[k]);
}
}