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

Graphs, c program to represent a graph as an adjacency multilist form c program to represent a graph as an adjacency multilist form

Algorithm, write an algorithm given each students name and grade points for... write an algorithm given each students name and grade points for six courses.find his grade point average and group students into the gpa groups 3.5

Program, circular queue using c circular queue using c

Define prims algorithm, Define Prim's Algorithm Prim's  algorithm  is  ... Define Prim's Algorithm Prim's  algorithm  is  a  greedy  algorithm  for  constructing  a  minimum  spanning  tree  of  a  weighted linked graph. It works by attaching to a bef

C programming, bank database bank database

Doubly linked list having n nodes, The time required to delete a node x fro... The time required to delete a node x from a doubly linked list having n nodes is O (1)

Algorithms and flowcharts, write an algorithm and draw a flowchart to calcu... write an algorithm and draw a flowchart to calculate the perimeter and area of a circle

Row major representation, Row Major Representation In memory the primar... Row Major Representation In memory the primary method of representing two-dimensional array is the row major representation. Under this representation, the primary row of the a

Hash function, Q. Define the graph, adjacency matrix, adjacency list, hash ... Q. Define the graph, adjacency matrix, adjacency list, hash function, adjacency matrix, sparse matrix, reachability matrix.

Circular linked list, In a circular linked list There is no beginning a... In a circular linked list There is no beginning and no end.