How java uses dichotomy to find specified elements in an array
This article is about how java uses binary to find specified elements in an array. The editor thinks it is very practical, so share it with you as a reference and follow the editor to have a look.
Search for specified elements in an array (binary search) A necessary condition for binary search is an ordered sequence of public static int binarySearch (int [] array,int key) {int left = 0; int right = array.length-1; while (left key) {right = mid-1;} else if (array [mid])
< key){ left = left + 1; }else{ return mid; } } return -1; } public static void main(String[] args) { int[] array = {12,14,15,16,18,23}; System.out.println(binarySearch(array, 15)); } 打印结果：
Thank you for reading! This is the end of this article on "how to use java to find the specified elements in a binary search array". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, you can share it out for more people to see!
