• 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

Find if two rectangles overlap

Amazon Interview Experience – SDE Chennai

Handle duplicates in Binary Search Tree

SAP Hiring Off-Campus General Aptitude

Test Cases for Round Function

Amazon Interview On-Campus For Internship – 1

Printing intermediate Integers between one element & next element of array

Find min element in Sorted Rotated Array (With Duplicates)

Binary Tree in Java

Find min element in Sorted Rotated Array (Without Duplicates)

Python Dictionaries

Flipkart Set 1 On Campus with Answers

Python String and numbers

Leetcode: Merge Intervals

Print Power Set of a Set

Max Sum in circularly situated Values

Subset Sum Problem Dynamic programming

Advanced SQL Injection

Find the number ABCD such that when multipled by 4 gives DCBA.

Find next greater number with same set of digits

Circular Linked List

25 horses 5 tracks Find 3 fastest puzzle

Find if a binary tree is height balanced ?

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Stickler thief

Coin Collection Dynamic Programming

Find Pythagorean Triplets in an array in O(N)

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

Sort Stack in place

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Copyright © 2026 · Genesis Framework · WordPress · Log in