This is a Java Program to Implement Ternary Search Algorithm. A ternary search algorithm is a technique in computer science for finding the minimum or maximum of an increasing or decreasing function. A ternary search determines either that the minimum or maximum cannot be in the first third of the domain or that it cannot be in the last third of the domain, then repeats on the remaining two-thirds. A ternary search is an example of a divide and conquer algorithm.
Here is the source code of the Java Program to Implement Ternary Search Algorithm. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/** ** Java Program to Implement Ternary Search Algorithm **/ import java.util.Scanner; /** Class TernarySearch **/ public class TernarySearch { /** call function **/ public static int ternarySearch (int[] A, int value) { return ternarySearch(A, value, 0, A.length - 1); } /** TernarySearch function **/ public static int ternarySearch (int[] A, int value, int start, int end) { if (start > end) return -1; /** First boundary: add 1/3 of length to start **/ int mid1 = start + (end-start) / 3; /** Second boundary: add 2/3 of length to start **/ int mid2 = start + 2*(end-start) / 3; if (A[mid1] == value) return mid1; else if (A[mid2] == value) return mid2; /** Search 1st third **/ else if (value < A[mid1]) return ternarySearch (A, value, start, mid1-1); /** Search 3rd third **/ else if (value > A[mid2]) return ternarySearch (A, value, mid2+1, end); /** Search middle third **/ else return ternarySearch (A, value, mid1,mid2); } /** Main method **/ public static void main(String[] args) { Scanner scan = new Scanner( System.in ); System.out.println("Ternary Search Test\n"); int n, i; /** Accept number of elements **/ System.out.println("Enter number of integer elements"); n = scan.nextInt(); /** Create integer array on n elements **/ int arr[] = new int[ n ]; /** Accept elements **/ System.out.println("\nEnter "+ n +" sorted integer elements"); for (i = 0; i < n; i++) arr[i] = scan.nextInt(); System.out.println("\nEnter element to search for : "); int key = scan.nextInt(); int result = ternarySearch(arr, key); if (result == -1) System.out.println("\n"+ key +" element not found"); else System.out.println("\n"+ key +" element found at position "+ result); } }
Ternary Search Test Enter number of integer elements 10 Enter 10 sorted integer elements 2 5 15 24 31 47 59 61 79 97 Enter element to search for : 24 24 element found at position 3
Related posts:
Java Program to Implement Stack
Java Program to implement Priority Queue
The Difference Between map() and flatMap()
Test a REST API with Java
How to Add a Single Element to a Stream
Java – String to Reader
Using JWT with Spring Security OAuth
Java Program to Implement Kosaraju Algorithm
Annotation trong Java 8
How to Store Duplicate Keys in a Map in Java?
Java String to InputStream
How to Break from Java Stream forEach
Guide to the Java TransferQueue
Removing all Nulls from a List in Java
Sao chép các phần tử của một mảng sang mảng khác như thế nào?
Using Spring ResponseEntity to Manipulate the HTTP Response
How to Iterate Over a Stream With Indices
Guide to the Synchronized Keyword in Java
Java Program to Perform Insertion in a BST
Retrieve User Information in Spring Security
REST Web service: Upload và Download file với Jersey 2.x
Java CyclicBarrier vs CountDownLatch
Number Formatting in Java
Spring Boot - Apache Kafka
Java Program to Implement Hash Tables chaining with Singly Linked Lists
Versioning a REST API
Spring Boot - Admin Client
Một số tính năng mới về xử lý ngoại lệ trong Java 7
Flattening Nested Collections in Java
Receive email by java client
Jackson Ignore Properties on Marshalling
HashSet trong java