折半查找(二分查找)原理的基本实现
二分查找算法是一种在有序数组中查找某一特定元素的搜索算法。搜素过程从数组的中间元素开始,如果中间元素正好是要查找的元素,则搜 素过程结束;如果某一特定元素大于或者小于中间元素,则在数组大于或小于中间元素的那一半中查找,而且跟开始一样从中间元素开始比较。如果在某一步骤数组 为空,则代表找不到。这种搜索算法每一次比较都使搜索范围缩小一半。折半搜索每次把搜索区域减少一半,时间复杂度为Ο(logn) 。
package com.test;
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;
public class BinarySearch {
public static void main(String[] args) {
@SuppressWarnings("resource")
Scanner scanner = new Scanner(System.in);
//创建一个int有序数组,大小n
System.out.print("输入数组大小:");
int n = scanner.nextInt();
Random random = new Random();
int []arr = new int[n];
for(int i = 0;i<n;i++) {
arr[i] = random.nextInt(100);
}
//数组排序
Arrays.sort(arr);
System.out.println("生成的有效数组为:");
for(int j=0 ;j<n;j++) {
System.out.print(arr[j]+" ");
}
System.out.println();
//输入您需要查找的值num
System.out.print("输入您需要查找的值num:");
int num = scanner.nextInt();
BinarySearch binarySearch = new BinarySearch();
int number = binarySearch.binarySearchFind(num,arr);
if(number == arr.length) {
System.out.println("您要找的数字不存在 ");
}else {
System.out.println("arr["+number+"] = "+ arr[number]);
}
//对排序后的数组插入一个数
System.out.print("输入您需要插入的数:");
int num1 = scanner.nextInt();
int []arrInsert = binarySearch.binarySearchInsert(num1, arr);
System.out.println("插入后的数组arrInsert为:");
for (int i = 0; i < arrInsert.length; i++) {
System.out.print(arrInsert[i]+" ");
}
System.out.println();
//删除数据
System.out.print("输入您要删除的数据:");
int num2 = scanner.nextInt();
boolean isTrue = binarySearch.binarySearchDelete(num2, arrInsert);
int lengthDelete = arrInsert.length-1;
if(isTrue = true) {
for(int i = 0; i<lengthDelete;i++) {
System.out.print(arrInsert[i]+" ");
}
System.out.println();
}else {
System.out.println("您要删除的数不存在");
}
//修改指定位置数字
System.out.print("输入您要修改位置:");
int num3 = scanner.nextInt();
System.out.print("输入修改后的数字:");
int numUp = scanner.nextInt();
boolean isExist = binarySearch.binarySearchUpdate( num3, arrInsert, numUp);
int lengthUp = lengthDelete;
if(isExist == true ) {
for(int i = 0; i < lengthUp; i++) {
System.out.print(arrInsert[i]+" ");
}
System.out.println();
}else {
System.out.println("您输入的位置不存在!");
}
}
//插入数据
public int[] binarySearchInsert(Integer num,int []arr) {
int []arrInsert = new int[arr.length+1];
for(int i=0;i<arr.length;i++){
arrInsert[i] = arr[i];//把旧数组中的元素拷贝到新数组中
}
int j;
for( j = 0; j<arrInsert.length; j++) {
if(arr[j] > num) {
break;
}
}
int newLength = arrInsert.length;
for(int k = newLength-1; k > j; k--) {
arrInsert[k] = arrInsert[k-1];
}
arrInsert[j] = num;
return arrInsert;
}
//删除数据
public boolean binarySearchDelete(Integer num,int []arr) {
int temp= binarySearchFind(num,arr);
if(temp != arr.length) {
for(int i = temp ; i <arr.length-1; i++) {
arr[i] = arr[i+1];
}
return true;
}
return false;
}
//更改指定数据
public boolean binarySearchUpdate(Integer num,int []arr ,int numUp) {
if(num > 0 && num <= arr.length) {
arr[num-1] = numUp;
return true;
}
return false;
}
//二分查找
public Integer binarySearchFind(Integer num,int []arr) {
int lower = 0;
int upper = arr.length-1;
int curIn;
while(true) {
curIn = (lower+upper)/2;
if(num == arr[curIn]) {
return curIn;
}else if(lower > upper) {
return arr.length;
}else {
if(arr[curIn] < num) {
lower = curIn+1;
}else {
upper = upper-1;
}
}
}
}
}