排序-选择排序

public class SelectSort {

	public static void main(String[] args) {
		  int[] arr = {1,9,2,8,3,7,4,6,8,2,5,0 };
	        print(arr, "初始");
	        bubbleSort(arr);
	        print(arr, "结果");

	}
	
	private static void bubbleSort(int[] arr) {
		int temp = 0;
		for (int i = 0; i < arr.length; i++) {
			for (int j = i+1; j < arr.length ; j++) {
				if (arr[i] > arr[j]) {
					temp = arr[j];
					arr[j] = arr[i];
					arr[i] = temp;
				}
			}
			print(arr, "第" + (i + 1) + "轮");
		}

	}
	//打印数组
  private static void print(int[] arr, String str) {
      for (int i = 0; i < arr.length; i++) {
          if (i != arr.length - 1) {
              if (i == 0) {
                  System.out.print("[" + arr[i] + ",");
              } else {
                  System.out.print(arr[i] + ",");
              }
          } else {
              System.out.println(arr[i] + "]" + "----" + str);
          }
      }
  }
}
[1,9,2,8,3,7,4,6,8,2,5,0]----初始
[0,9,2,8,3,7,4,6,8,2,5,1]----第1轮
[0,1,9,8,3,7,4,6,8,2,5,2]----第2轮
[0,1,2,9,8,7,4,6,8,3,5,2]----第3轮
[0,1,2,2,9,8,7,6,8,4,5,3]----第4轮
[0,1,2,2,3,9,8,7,8,6,5,4]----第5轮
[0,1,2,2,3,4,9,8,8,7,6,5]----第6轮
[0,1,2,2,3,4,5,9,8,8,7,6]----第7轮
[0,1,2,2,3,4,5,6,9,8,8,7]----第8轮
[0,1,2,2,3,4,5,6,7,9,8,8]----第9轮
[0,1,2,2,3,4,5,6,7,8,9,8]----第10轮
[0,1,2,2,3,4,5,6,7,8,8,9]----第11轮
[0,1,2,2,3,4,5,6,7,8,8,9]----第12轮
[0,1,2,2,3,4,5,6,7,8,8,9]----结果
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值