java算法

二分查找

public class _07二分查找 {
	public static void main(String[] args) {
		int[] data = {1,2,3,4,5,6,7,8,9};
		int result =-1; //查找下标
		
		int key = 4; //我要查找的
		
		int low = 0;
		
		int height = data.length-1; //8
		
		while(height>=low) {
			int mid = (height+low)/2;  //data【4】 == 5
			
			if(data[mid] == key) {
				result = mid;
				System.out.println(result);
				break;
			}else if(key > data[mid]) {
				low = mid + 1;
			}else {
				height = mid - 1;
			}
		}
	}
}

冒泡排序

import java.util.Arrays;

public class _06冒泡排序 {
public static void main(String[] args) {
	
	int[] data = {44,3,56,32};
	 //跑几趟 3趟 重点！！
	for(int i = 1; i<data.length; i++) {
		
		for(int j = 0; j<data.length-1; j++) {
			//下标判定
			if (data[j] > data[j+1]) {
				
				int num = data[j];
				
				data[j] = data[j+1];
				
				data[j+1] = num;
			}
		}
	}
	System.out.println(Arrays.toString(data));
	
	}
}