冒泡
package 数组.冒泡;
public class Test1 {
public static void main(String[] args) {
int temp ;
int[] success ={40,10,38,45,20,50,30,22,4};
for (int i = 0; i <success.length ; i++) {
boolean cout =false;
for (int j = 0; j < success.length-i-1; j++) {
if (success[j+1]<success[j]){
temp=success[j];
success[j]=success[j+1];
success[j+1]=temp;
cout =true;
}
}
if(cout==false){
break;
}
}
for (int i : success) {
System.out.print(i+"\t");
}
}
}
二分法
package 数组.二分法;
import java.util.Arrays;
import java.util.Scanner;
public class Test1 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.println("请输入你要查的数字");
int aaa = scanner.nextInt();
int[] success ={40,10,38,45,20,50,30,22,4};
Arrays.sort(success);
int low =0;
int high =success.length-1;
while (low<=high){
int midd =(low+high)/2;
if(aaa==success[midd]){
System.out.println("已找到"+aaa+"在第一次出现的位置是第"+(midd+1)+"个");
break;
}if (aaasuccess[midd]){
low=midd+1;
}
}
}
}