m0_46671240的博客

Algorithm’ thought:Therer is a array with x number.First round find a minimum number,move it out of array,and next round make the ramaining number compare,

二分法要求被查求的元素有序

public class aaa { public static void main(String[] args) { int count=0; int[] arr = {4,8,2,9,43,65,2}; for(int i = arr.length-1;i > 0;i--) { for(int j = 0;j < i;j++) { //Despite exchange happen or not,comparison times plus 1