java冒泡排序

代码如下：

public class BubbleSort {
	public static void bubbleSort(DataWrap [] data)
	{
		System.out.println("开始排序");
		int length = data.length;
		for(int i = 0;i < length-1;i++)
		{
			boolean flag = false;
			for(int j = 0;j < length-1-i;j++)
			{
				//如果j索引处的元素大于j+1处索引的元素
				if(data[j].compareTo(data[j+1]) >0)
				{
					//交换它们
					DataWrap tep = data[j+1];
					data[j+1] = data[j];
					data[j] = tep;
					flag = true;
				}
			}
			System.out.println(java.util.Arrays.toString(data));
			//如果某趟没有发生交换，则表明已处于有序状态
			if(!flag)
			{
				break;
			}
		}
	}
	public static void main(String[] args) {
		DataWrap[] data = {
				new DataWrap(21, ""),
				new DataWrap(30, ""),
				new DataWrap(49, ""),
				new DataWrap(30, ""),
				new DataWrap(16, ""),
				new DataWrap(9, "")
		};
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		bubbleSort(data);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

　　

转载于:https://www.cnblogs.com/jialin1402/p/7397539.html