Shulou(Shulou.com)06/02 Report--

Today, I will talk to you about how to achieve binary search in java. Many people may not know much about it. In order to make you understand better, the editor has summarized the following content for you. I hope you can get something according to this article.

Package helloclean;import java.util.Arrays;public class MidSearch {public static void main (String [] args) {MidSearch midSearch = new MidSearch (); / / int [] arry = {1meme 3pje 5pje 7pies 9pies 11}; int [] arry = {10pence 1pens 2pens 2pens 8pens 6}; int [] arry1 = midSearch.getSortedArry (arry); System.out.println (Arrays.toString (arry1)); int key = 8 Int x = find (arry,key); if (x = =-1) {System.out.println ("key =" + key + "not found");} else {System.out.println ("key =" + key + "position is:" + x);}} public int [] bubbleSort (int [] arr) {int temp / / define a temporary variable for (int itemo high | | key

Array [high]) {return-1;} while (low key) {high = mid-1;} else if (array [mid] < key) {low = mid + 1;} else {return mid;}} return-1 }} after reading the above, do you have any further understanding of how to implement binary search in java? If you want to know more knowledge or related content, please follow the industry information channel, thank you for your support.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.