"Binary Search implementation" Code Answer's

You're definitely familiar with the best coding language C++ that developers use to develop their projects and they get all their queries like "Binary Search implementation" answered properly. Developers are finding an appropriate answer about Binary Search implementation related to the C++ coding language. By visiting this online portal developers get answers concerning C++ codes question like Binary Search implementation. Enter your desired code related query in the search bar and get every piece of information about C++ code related question on Binary Search implementation. 

binary search algorithm

By Glamorous GibbonGlamorous Gibbon on Jan 16, 2021
#include <bits/stdc++.h>

using namespace std;

int binarySearch(int arr[], int l, int h, int key){
    if(l<=h){
        int mid = l + (h-l)/2;

        if(arr[mid] == key){
            return mid;
        }

        else if(arr[mid] > key){
            return binarySearch(arr, l, mid-1, key);
        }

        else if(arr[mid] < key){
            return binarySearch(arr,mid+1, h, key);
        }
    }       

    return -1;
}

int main(){
    int arr[] = {1,2,3,4,5,6,7,8,9,10};
    int n = sizeof(arr)/sizeof(arr[0]);
    int key = 7;

    int result = binarySearch(arr,0,n-1,key);

    (result==-1)
        ? cout << "Element is not found in the array" << endl
        : cout << "Element is found at index " << result;

    return 0;

}

Add Comment

0

binary search iterative

By Anirudh PundirAnirudh Pundir on Jun 23, 2020
// Binary Search using Iterative Approach

import java.io.*;
class Binary_Search
{
	public static void main(String[] args) throws Exception
	{
		Binary_Search obj = new Binary_Search();
		InputStreamReader isr = new InputStreamReader(System.in);
		BufferedReader br = new BufferedReader(isr);
		System.out.println("Insert the length of the Array : ");
		int n = Integer.parseInt(br.readLine());
		int arr[] = new int[n];
		System.out.println("Insert elements into the array : ");
		for(int i=0;i<n;i++)
		{
			arr[i] = Integer.parseInt(br.readLine());
		}
		System.out.println("Enter the num which you want to Search : ");
		int num = Integer.parseInt(br.readLine());
		obj.logic(arr,num);
	}
	void logic(int arr[],int num)
	{
		int r = arr.length - 1;
		int l = 0;
		int mid;
		while(l<=r)
		{
			mid = l + (r-l)/2;
			if(arr[mid] == num)
			{
				System.out.println("Number found at "+mid+"th index");
				break;
			}
			else if(arr[mid]>num)
			{
				r = mid - 1;
			}
			else
			{
				l = mid + 1;
			}
		}
	}
}

Add Comment

0

All those coders who are working on the C++ based application and are stuck on Binary Search implementation can get a collection of related answers to their query. Programmers need to enter their query on Binary Search implementation related to C++ code and they'll get their ambiguities clear immediately. On our webpage, there are tutorials about Binary Search implementation for the programmers working on C++ code while coding their module. Coders are also allowed to rectify already present answers of Binary Search implementation while working on the C++ language code. Developers can add up suggestions if they deem fit any other answer relating to "Binary Search implementation". Visit this developer's friendly online web community, CodeProZone, and get your queries like Binary Search implementation resolved professionally and stay updated to the latest C++ updates. 

C++ answers related to "Binary Search implementation"

View All C++ queries

C++ queries related to "Binary Search implementation"

Binary Search implementation how to do binary search in c++ using STL binary search tree in cpp using class binary search program c++ binary search stl binary search function in c++ binary search in c++ binary tree search deletion in a binary search tree c++ binary search binary search algorithm binary search tree sorted order c++ binary search lower bound C Binary Search binary search in java binary search in c binary search in stl linkedlist implementation in c++ avl tree implementation c++ preemptive priority scheduling implementation in c quicksort implementation c++ dynamic programming with code implementation in c++ heap sort internal implementation using c++ code implementation of krushkals algorithm linked list class c++ basic implementation convert binary to decimal c++ stl binary exponentiation binary index tree c++ binary sort c++ binary addition using bitwise operators convert decimal to binary in c++ convert int to binary string c++ binary exponentiation modulo m binary indexed tree c++ display numbers as binary built in function in c++ for binary to decimal write and read string binary file c++ convert long int to binary string c++ print binary in c binary tree deletion how to do decimal to binary converdsion in c++ Decimal to binary c++ top view of binary tree c++ binary heap heap sort heapify and max heap in binary tree decimal to binary predefined function find number of 1s in a binary cv::mat image c++ vector decimal to binary Print Decimal to binary using stack is obje file binary?? how to find the left most bit 1 in binary of any number searching display insert in a binary serach tree how to show c++ binary files in sublime text binary algebra cpp building native binary with il2cpp unity Write a program in C++ to find post-order predecessor of a node in a Binary Tree vertical traversal of binary tree Print Nodes in Top View of Binary Tree search in vector of pairs c++ array search c++ ternary search c++ delete and search edge in adjacency matrix of a graph how to search integer in c++ c++ vector quick search dichotomic search c++ linear search in c bst search linear search

Browse Other Code Languages

CodeProZone