• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Implement a generic binary search algorithm for Integer Double String etc

March 20, 2014 by Dhaval Dave

A Simple Binary Search for Integers

BinarySearch(A[0..N-1], value) 
{
   low = 0
   high = N - 1
   while (low <= high) {
       mid = low + ((high - low) / 2)
       if (A[mid] > value)
           high = mid - 1
       else if (A[mid] < value)
           low = mid + 1
       else
           return mid // found
    }//while end
   return -1 // not found
}


To implement  Generic Binary Search

– Comparison must be based upon Data type of Input.
– to get Data type of Input
– sizeof( )
Eg:

#define TYPE(x)(
       sizeof(x) == sizeof(integer) ? return integer:
       sizeof(x) == sizeof(character) ? return char:
       sizeof(x) == sizeof(double)) ? return double :
       )

 

– Make function to compare according to size.

Compare (A[mid] , value)
{
if(TYPE(A[mid] != TYPE(value)) return null;

if ( TYPE( A[mid] == integer ){ 
//Simple comparison and return
}

if ( TYPE( A[mid] == character ){
// Compare with User Defined which function which checks for lexicographic order.
//See Void CompareLexo()
}
 
}//
Compare Void CompareLexo(){ 
//pseudo code to understand logic. 
 const char* string = "Bac"; 
 int c = strcmp(string, "Bca");  //c will be <= -1 
 int c = strcmp(string, "B");  //c will be >=1 
}

The same way you can think for Double , Structure etc Input and create your code.

PS : Please comment/mail us perfect running code or better logic

 

Similar Articles

Filed Under: problem Tagged With: algorithm

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Leetcode: Edit Distance

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

How strtok() Works

strtok()

Given Set of words or A String find whether chain is possible from these words or not

Find min element in Sorted Rotated Array (With Duplicates)

Edit Distance ( Dynamic Programming )

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Practo Hiring Experience

Apriori algorithm C Code Data Mining

Find and print longest consecutive number sequence in a given sequence in O(n)

Number of Islands BFS/DFS

Regular Expression Matching

SAP Off Campus Hiring_ March 2015 Computer Skills

Given a string, find the first character which is non-repetitive

Closed Parentheses checker

SAP Hiring Off-Campus General Aptitude

BFS (Breath First Search)

Difference between a LinkedList and a Binary Search Tree BST

Binary Tree in Java

Subset Sum Problem Dynamic programming

Coin Collection Dynamic Programming

CodeChef Code SGARDEN

Connect n ropes with minimum cost

Printing Longest Common Subsequence

Client Server C program

HackeEarth Flipkart’s Drone

Leetcode: Merge Intervals

Naurki.com Security Breach

Copyright © 2026 · Genesis Framework · WordPress · Log in