Binary Search Algorithm is given as follows

1. if (low > high)

2.     return (-1)

3. mid = (low +high)/2;

4. if ( X = = a [mid])

5.      return (mid);

6. if ( X < a [mid])

7.    search for X in a (low) to [mid -1];

8.    else

9.     search for X in a [mid + 1] to a [high];

 

 

Posted Date: 7/13/2012 1:27:42 AM | Location : United States

Ask an Expert

Related Discussions:- Present the algorithm of binary search. , Assignment Help, Ask Question on Present the algorithm of binary search. , Get Answer, Expert's Help, Present the algorithm of binary search. Discussions

Write discussion on Present the algorithm of binary search.
Your posts are moderated

Write your message here..

Related Questions

Algorithm to merge two sorted arrays with third array, Q. Write down an alg... Q. Write down an algorithm to merge the two sorted arrays into the third array. Do  not perform the sort function in the third array.                           Ans: void m

Explain the bubble sort algorithm, Explain the bubble sort algorithm. ... Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

Program, insertion and deletion in a tree insertion and deletion in a tree

Algorithm for the selection sort, Q. Give the algorithm for the selection s... Q. Give the algorithm for the selection sort. Describe the behaviours of selection sort when the input given is already sorted.

Determine the class invariants- ruby, Determine the class invariants- Ruby ... Determine the class invariants- Ruby Ruby has many predefined exceptions classes (like ArgumentError) and new ones can be created easily by sub-classing StandardError, so it's

Determine the term - loops, Loops There are 3 common ways of performin... Loops There are 3 common ways of performing a looping function: for ... to ... next, while ... endwhile and repeat ... until The below example input 100 numbers and find

Polynomials - represented by using arrays, /* the program accepts two polyn... /* the program accepts two polynomials as a input & prints the resultant polynomial because of the addition of input polynomials*/ #include void main() { int poly1[6][

Binary search, Explain binary search with an example Explain binary search with an example

Illustrate the wire frame representation, RENDERING, SHADING AND COLOURING ... RENDERING, SHADING AND COLOURING By introducing hidden line removal we have already taken one step away from wire-frame drawings towards being able to realistically model and d

Basic concept of the primitive data structures, Q. Explain the basic concep... Q. Explain the basic concept of the primitive data structures.                                             Ans. The concept of P r i m i t i ve Data