java 实现二分查找

package com.example.binarySearch;

public class BinarySearch {
	static void binarySearch(int[] a, int num,int p,int q) {
		if(p>q){
			System.out.println("no match");
			return;
		}
		int temp_int = (q-p)/2 + p;
		if(a[temp_int] == num){
			System.out.println(temp_int+1);
			return;
		}
		if(a[temp_int]>num){
			binarySearch(a,num,p,temp_int-1);
		}
		if(num>a[temp_int]){
			binarySearch(a,num,temp_int+1,q);
		}
	}

	public static void main(String[] args) {
		int[] a = {1,2,3,4,5};
		binarySearch(a, 6, 0, a.length-1);
	}

}