This is a java program to search sequence using binary search. This is a simple extension of binary search algorithm to find an element.
Here is the source code of the Java Program to Implement a Binary Search Algorithm for a Specific Search Sequence. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
package com.sanfoundry.combinatorial; import java.util.Random; import java.util.Scanner; public class BinarySearchSequence { public static void searchSequence(int[] array, int[] search) { int first, last, middle; first = 0; last = array.length - 1; boolean flag = true; for (int i = 0; i < search.length; i++) { middle = (first + last) / 2; while (first <= last && flag == true) { if (array[middle] < search[i]) { first = middle + 1; } else if (array[middle] == search[i]) { System.out.println(search[i] + " found at location " + (middle + 1) + "."); first = 0; last = array.length - 1; break; } else { last = middle - 1; } middle = (first + last) / 2; } if (first > last) { System.out .println(search[i] + " is not present in the list."); flag = false; } } } public static void main(String args[]) { int c, n, search[], array[]; Scanner in = new Scanner(System.in); System.out.println("Enter number of elements: "); n = in.nextInt(); array = new int[n]; Random rand = new Random(); for (c = 0; c < n; c++) { array = rand.nextInt(100); } System.out.println("Elements: "); for (int i = 0; i < array.length; i++) { System.out.print(array[i] + " "); } System.out.println("\nEnter length of sequence to find: "); int m = in.nextInt(); search = new int[m]; System.out.println("Enter the sequence to find: "); for (int i = 0; i < m; i++) { search[i] = in.nextInt(); } searchSequence(array, search); in.close(); } }
Output:
$ javac BinarySearchSequence.java $ java BinarySearchSequence Enter number of elements: 10 Elements: 68 45 85 63 7 48 44 93 10 20 Enter length of sequence to find: 2 Enter the sequence to find: 7 48 7 found at location 5. 48 found at location 6. Enter number of elements: 10 Elements: 60 52 44 55 55 25 34 97 24 18 Enter length of sequence to find: 3 Enter the sequence to find: 2 3 4 2 is not present in the list. 3 is not present in the list. 4 is not present in the list.
Related posts:
Java Program to Evaluate an Expression using Stacks
Giới thiệu Design Patterns
Constructor Injection in Spring with Lombok
Spring Boot - Tomcat Port Number
Java Program to Implement Vector API
Java Program to Check whether Graph is Biconnected
Java Program to Implement ConcurrentHashMap API
Guide to @JsonFormat in Jackson
Java Program to Implement Direct Addressing Tables
Guide to Guava Table
Remove All Occurrences of a Specific Value from a List
Java Program to Implement Ternary Search Algorithm
A Guide to the ResourceBundle
Java Program to Perform Optimal Paranthesization Using Dynamic Programming
Java Program to Implement Variable length array
Java Program to Generate Random Numbers Using Probability Distribution Function
Java Program to Represent Linear Equations in Matrix Form
Java Program to Check Whether a Directed Graph Contains a Eulerian Cycle
Spring Boot - Web Socket
Java Program to Perform Stooge Sort
Guide to Character Encoding
Java Program to Implement AA Tree
Spring Security Registration – Resend Verification Email
Giới thiệu Java 8
Java Program to Implement Adjacency List
Java Program to Check Multiplicability of Two Matrices
The SpringJUnitConfig and SpringJUnitWebConfig Annotations in Spring 5
Java Program to Implement Bellman-Ford Algorithm
Exploring the Spring Boot TestRestTemplate
Vector trong Java
The StackOverflowError in Java
Marker Interface trong Java