class
BubbleSort
...
{
public static int[] bubbleSort(int[] array)...{
for(int i=0;i<array.length-1;i++)...{
for(int j=0;j<(array.length-i)-1;j++)...{
if(array[j]>array[j+1])...{
array[j] = array[j] + array[j+1];
array[j+1] = array[j] - array[j+1];
array[j] = array[j] - array[j+1];
}
}
}
return array;
}
public static void print(int[] array)...{
for(int i=0;i<array.length;i++)
System.out.print("array[" + i + "] = " + array[i] + "; ");
}
}
public static int[] bubbleSort(int[] array)...{
for(int i=0;i<array.length-1;i++)...{
for(int j=0;j<(array.length-i)-1;j++)...{
if(array[j]>array[j+1])...{
array[j] = array[j] + array[j+1];
array[j+1] = array[j] - array[j+1];
array[j] = array[j] - array[j+1];
}
}
}
return array;
}
public static void print(int[] array)...{
for(int i=0;i<array.length;i++)
System.out.print("array[" + i + "] = " + array[i] + "; ");
}
}
改进算法:
class
BubbleSort
...
{
public static void main(String[] args)...{
int[] array = ...{49,38,65,97,76,13,27};
boolean flag=true;
for(int i=0;i<array.length-1 && flag;i++)...{
flag = false;
for(int j=0;j<(array.length-i)-1;j++)...{
if(array[j]>array[j+1])...{
array[j] = array[j] + array[j+1];
array[j+1] = array[j] - array[j+1];
array[j] = array[j] - array[j+1];
flag = true;
}
}
print(array);
System.out.print(" ");
}
}
public static void print(int[] array)...{
for(int i=0;i<array.length;i++)
System.out.print("array[" + i + "] = " + array[i] + "; ");
}
}
public static void main(String[] args)...{
int[] array = ...{49,38,65,97,76,13,27};
boolean flag=true;
for(int i=0;i<array.length-1 && flag;i++)...{
flag = false;
for(int j=0;j<(array.length-i)-1;j++)...{
if(array[j]>array[j+1])...{
array[j] = array[j] + array[j+1];
array[j+1] = array[j] - array[j+1];
array[j] = array[j] - array[j+1];
flag = true;
}
}
print(array);
System.out.print(" ");
}
}
public static void print(int[] array)...{
for(int i=0;i<array.length;i++)
System.out.print("array[" + i + "] = " + array[i] + "; ");
}
}