java之二分查找

最新推荐文章于 2024-02-22 16:25:59 发布

gt-liu

最新推荐文章于 2024-02-22 16:25:59 发布

阅读量331

点赞数

分类专栏： java 文章标签： java

本文链接：https://blog.csdn.net/euller/article/details/50989411

版权

java 专栏收录该内容

73 篇文章 1 订阅

订阅专栏

二分查找的前提条件是数组中的元素必须已经排序，不管是按照升序还是降序排列。
示例代码如下：

//二分查找
import java.util.*;
public class Demo032605{
    public static int binarySearch( int[] list, int number ){
        int low = 0;
        int high = list.length-1;
        while ( high >= low ){
            int mid = ( low + high ) / 2;
            if ( number > list[mid] )
                low = mid + 1;
            else if ( number == list[mid] )
                return mid;
            else
                high = mid - 1;
        }
        return -1;
    }

    public static void main( String [] args ){
        int[] list = { 2, 4, 5, 6, 11, 12,45,66,88,87,90,99,233 };
        for ( int i = 0; i < list.length; i++ ){
            System.out.print( list[i] + "\t" );
        }
        System.out.println( "\n" );
        Scanner input = new Scanner( System.in );
        System.out.print( "please input a number: " );
        int number = input.nextInt();
        int k = binarySearch( list, number );
        System.out.println( "The " + number + " list is " + k );
    }
}