JAVA EXAMPLE PROGRAMS

JAVA EXAMPLE PROGRAMS

Publish Your Article Here

Program: Implement Binary search in java using recursive algorithm.


A binary search or half-interval search algorithm finds the position of a specified value (the input "key") within a sorted array. In each step, the algorithm compares the input key value with the key value of the middle element of the array. If the keys match, then a matching element has been found so its index, or position, is returned. Otherwise, if the sought key is less than the middle element's key, then the algorithm repeats its action on the sub-array to the left of the middle element or, if the input key is greater, on the sub-array to the right. If the remaining array to be searched is reduced to zero, then the key cannot be found in the array and a special "Not found" indication is returned.

Every iteration eliminates half of the remaining possibilities. This makes binary searches very efficient - even for large collections.

Binary search requires a sorted collection. Also, binary searching can only be applied to a collection that allows random access (indexing).

Worst case performance: O(log n)

Best case performance: O(1)

Recursion is used in this algorithm because with each pass a new array is created by cutting the old one in half. The binary search procedure is then called recursively, this time on the new array. Typically the array's size is adjusted by manipulating a beginning and ending index. The algorithm exhibits a logarithmic order of growth because it essentially divides the problem domain in half with each pass.


package com.java2novice.algos;

public class MyRecursiveBinarySearch {

	public static int recursiveBinarySearch(int[] sortedArray, int start, int end, int key) {
	    
	    if (start < end) {
	        int mid = start + (end - start) / 2;  
	        if (key < sortedArray[mid]) {
	            return recursiveBinarySearch(sortedArray, start, mid, key);
	            
	        } else if (key > sortedArray[mid]) {
	            return recursiveBinarySearch(sortedArray, mid+1, end , key);
	            
	        } else {
	            return mid;   
	        }
	    }
	    return -(start + 1);  
	}

	public static void main(String[] args) {
		
		int[] arr1 = {2,45,234,567,876,900,976,999};
		int index = recursiveBinarySearch(arr1,0,arr1.length,45);
		System.out.println("Found 45 at "+index+" index");
		index = recursiveBinarySearch(arr1,0,arr1.length,999);
		System.out.println("Found 999 at "+index+" index");
		index = recursiveBinarySearch(arr1,0,arr1.length,876);
		System.out.println("Found 876 at "+index+" index");
	}
}

Output:
Found 45 at 1 index
Found 999 at 7 index
Found 876 at 4 index
<< Previous Program 
blog comments powered by Disqus

Java Search Algorithms Examples

  1. Write a program to implement Linear search or Sequential search algorithm.
  2. Implement Binary search in java using divide and conquer technique.
  3. Implement Binary search in java using recursive algorithm.
Knowledge Centre
wait Vs sleep methods
sleep(): It is a static method on Thread class. It makes the current thread into the "Not Runnable" state for specified amount of time. During this time, the thread keeps the lock (monitors) it has acquired.

wait(): It is a method on Object class. It makes the current thread into the "Not Runnable" state. Wait is called on a object, not a thread. Before calling wait() method, the object should be synchronized, means the object should be inside synchronized block. The call to wait() releases the acquired lock.
Famous Quotations
The greatest obstacle to discovery is not ignorance; it is the illusion of knowledge.
-- Daniel J. Boorstin

About Author

Most Visited Pages

Other Interesting Sites

Reference: Java™ Platform Standard Ed. 7 - API Specification | Java is registered trademark of Oracle.
Privacy Policy | Copyright © 2017 by Nataraja Gootooru. All Rights Reserved.