Write an algorithm for binary search.

Algorithm for Binary Search

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 a[mid-1]
8.  else
9.  search for X in a[mid+1] to a[high] 

Posted Date: 5/10/2013 5:14:26 AM | Location : United States

Ask an Expert

Related Discussions:- Write an algorithm for binary search., Assignment Help, Ask Question on Write an algorithm for binary search., Get Answer, Expert's Help, Write an algorithm for binary search. Discussions

Write discussion on Write an algorithm for binary search.
Your posts are moderated

Write your message here..

Related Questions

Explain thread, Thread By changing the NULL lines in a binary tree to ... Thread By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using either a stack

Tree traversals, There are three kinds of tree traversals, namely, Postorde... There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo

Basic organization of computer system, what happen''s in my computer when ... what happen''s in my computer when i input any passage

Acyclic graph, Tree is a widely used data structure employed for representi... Tree is a widely used data structure employed for representing several problems. We studied tree like a special case of acyclic graph. Though, rooted trees are most prominent of al

Write the algorithm to find input and output value, This algorithm inputs 5... This algorithm inputs 5 values and outputs how many input numbers were positive and how many were negative. Data to be used: N = 1, -5, 2, -8, -7

What is a linear array, What is a linear array? An array is a way to re... What is a linear array? An array is a way to reference a series of memory locations using the similar name. Every memory location is shown by an array element. An  array elemen

Interest rate, explain the determination of interest rate in the classical ... explain the determination of interest rate in the classical system.

The quick sort algorithm exploit design technique, The quick sort algorithm... The quick sort algorithm exploit design technique Divide and Conquer

Illustrate the back face detection method, Illustrate the Back Face Detecti... Illustrate the Back Face Detection Method A single polyhedron is a convex solid, which has no external angle between faces less  than 180° and there is a simple object space me

Logical database design, 1. For the ER diagram you created in assignment, t... 1. For the ER diagram you created in assignment, the artefact of the conceptual database design, map the ER model into the relational model according to how it was designed in the