各种排序的复习-交换类排序之冒泡排序
首先介绍冒泡排序：
注意：
1.冒泡，是稳定算法,属于交换类排序
package merge;
import java.util.Arrays;
/**
* 冒泡，是稳定算法,属于交换类排序
* @author Administrator
*
*/
public class BubbleSort {
public int[] items;
private int size;
public BubbleSort(int[] arrays) {
size = arrays.length;
items = Arrays.copyOf(arrays, size);
}
public int[] sort() {
for(int i = size - 1; i > 0; i--) {
for(int j = 0; j < i; j++) {
if(items[j] >items[j+1])
{
change(j,j+1);
}
}
}
return items;
}
private void change(int i,int j)
{
int temp = items[i];
items[i] = items[j];
items[j] = temp;
}
public static void main(String[] args)
{
int[] a= new int[] {11,1,0,9,8,7,6,5,4,3,3,2,1,11};
BubbleSort m = new BubbleSort(a);
a = m.sort();
for(int item : a)
{
System.out.print(item + " ");
}
}
}
