Coding Challenge Day 8: Problem 2: Binary Search

Hello! So I’m doing a 30 day coding challenge where I solve around 3-5 questions per day and thought of posting them here on my blog so that you guys can join the challenge too!

Welcome to Coding challenge Day 8: Problem 2! Be sure to post your answers, queries etc in the comments!

Problem: Write a progam to perform Binary Search on an Integer Array

Sample input: {3,1,6,8,9,10,2,4,5,7} search_element= 4
Output: Element found

Sample input:{3,1,6,8,9,10,2,4,5,7} search_element= 14
Output: Element not found

Solution

package array;

public class Program009binary_search {
	
	public static void main (String [] args){
		int array[]= {3,1,6,8,9,10,2,4,5,7};
		int search_element= 4;
		int length= array.length;
		
		for(int i=0; i<length-1; i++){
			for(int j=0; j<length-i-1; j++){
				if(array[j]>array[j+1]){
					int temp= array[j];
					array[j]= array[j+1];
					array[j+1]= temp;
				}
			}
		}
		
		int LB=0, UB=length-1, mid;
		boolean Found=false;
		
		while(LB<=UB && !Found){
			mid= (LB+UB)/2;
			
			if(array[mid]>search_element)
				UB=mid-1;
			
			else if (array[mid]<search_element)
				LB= mid+1;
			
			else 
				Found=true;
			
		}
		
		if(Found)
			System.out.println("Element found ");
		else
			System.out.println("Element not found");
		
	}

}

Download Code

Happy Learning!!

Leave a Reply

PHP JS HTML CSS BASH PYTHON CODE

Your email address will not be published.

This site uses Akismet to reduce spam. Learn how your comment data is processed.

%d bloggers like this: