//选择排序法,和冒泡排序法(java)
package javaapplication4;
public class JavaApplication4{
static int count1=0;
static int count2=0;
public static void main(String[] args){
int []array={49,38,65,97,76,13,27,49};
print(array);
selectSort(array);
print(array);
bubble(array);
print(array);
}
public static void selectSort(int []array)//选择排序
{
for (int i = 0; i < array.length-1; i++) {
for (int j = i+1; j < array.length; j++) {
count1++;//计数
if(array[i]>array[j])
{
array[i]=array[i]^array[j];
array[j]=array[i]^array[j];
array[i]=array[i]^array[j];
}
}
}
System.out.println(count1);
}
public static void bubble(int []array)//冒泡排序
{
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array.length-1-i; j++) {//每次循环减去一个已经排序好的项
count2++;
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];
}
}
}
System.out.println(count2);
}
public static void print(int []array)
{
for (int i = 0; i < array.length; i++) {
System.out.print(array[i]);
System.out.print(",");
}
System.out.print("\b");//去掉最后的","
System.out.print("\n");
}
}