冒泡排序和二分查找

最新推荐文章于 2024-09-27 14:28:55 发布

xy58451921

最新推荐文章于 2024-09-27 14:28:55 发布

阅读量40

点赞数

分类专栏： Java基础文章标签：算法 java 排序算法

本文链接：https://blog.csdn.net/xy58451921/article/details/129243779

版权

Java基础专栏收录该内容

12 篇文章 0 订阅

订阅专栏

该代码示例展示了如何使用Java编程实现冒泡排序对整数数组进行排序，并应用二分查找方法在一个已排序的数组中查找特定数值。程序首先进行冒泡排序，然后在排序后的数组中执行二分查找来定位给定数值的位置。

摘要由CSDN通过智能技术生成

/**
 * @packageName: PACKAGE_NAME
 * @user: lixi
 * @date: 2023/2/27 15:38
 * @email 1831309074@qq.com
 * @description: 冒泡排序+二分查找
 */
public class SuanFaClass {
    static int[] ints = {1,3,5,7,9,2,4,6,8};
    public static void main(String[] args) {
        int in = 5;
        sortInts(ints);
        binaryInts(in);
    }

    private static void sortInts(int[] ints) {
        for (int j = 0; j < ints.length-1; j++) {
            for (int i = 0; i < ints.length-1-j; i++) {
                int temp;
                if (ints[i] > ints[i+1]){
                    temp = ints[i];
                    ints[i] = ints[i+1];
                    ints[i+1] = temp;
                }
            }
        }
        for (int i = 0; i < ints.length; i++) {
            System.out.print(ints[i]);
        }
    }
    private static void binaryInts(int in) {
        int start = 0;
        int end = ints.length-1;
        int middle;
        for (int i = 0; i < ints.length; i++) {
            if (in >= ints[start] && in <= ints[end]){
                middle = (start+end)/2;
                while (start<=end){
                    if(in > ints[middle]){
                        start = middle+1;
                        middle = (start+end)/2;
                    }else if (in < ints[middle]){
                        end = middle-1;
                        middle = (start+end)/2;
                    }else {
                        System.out.println("您找的数字在"+(middle+1)+"位");
                        return;
                    }
                }
            }
        }
    }
}