字符串中涉及到的二分查找和倒序算法

package com.yuwenzhi;

/**
 * 数组反转
 *
 * @author 宇文智
 * @create 2020-06-30 9:57
 */
public class ArrayReverse {
    //数组序列反转
    public void arrReverse(int[] arr) {
        for (int i = 0, j = arr.length - 1; i < j; i++, j--) {
            int temp = arr[i];
            arr[i] = arr[j];
            arr[j] = temp;
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }


    }

    //数组中二分法查找元素
    public void linearSearch(int[] arr) {
        int number = 6;
        int head = 0;
        int end = arr.length - 1;
        boolean flag = false;
        while (head <= end) {
            int middle = (head + end) / 2;
            if (arr[middle] == number) {
                System.out.println(number + "在数组中所在位置的索引：" + middle);
                flag = true;
                break;
            } else if (arr[middle] > number) {
                end = middle - 1;
            } else {
                head = middle + 1;
            }
        }
        if (!flag) {
            System.out.println("不存在");
        }
    }

}