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

Your posts are moderated

Write your message here..

Related Questions

FIRST function in the compiler construction, I need a recursive algorithm t... I need a recursive algorithm to implement the FIRST function to any grammar

Sd, sdsd. sdsd.

Explain complexity of an algorithm, Complexity of an Algorithm An algo... Complexity of an Algorithm An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorith

Determine about the post conditions assertion, Determine about the Post con... Determine about the Post conditions assertion A  post condition is an assertion which should be true at completion of an operation. For instance, a post condition of the squ

Deletion of an element from the linear array, Program will demonstrate dele... Program will demonstrate deletion of an element from the linear array /* declaration of delete_list function */ voiddelete_list(list *, int); /* definition of delete_list

Determine the critical path and the expected completion, The information in... The information in the table below is available for a large fund-raising project. a. Determine the critical path and the expected completion time of the project. b. Plot the total

The smallest element of an array''s index, The smallest element of an array... The smallest element of an array's index is called its Lower bound.

Execute algorithm to convert infix into post fix expression, Q. Execute you... Q. Execute your algorithm to convert the infix expression to the post fix expression with the given infix expression as input Q = [(A + B)/(C + D) ↑ (E / F)]+ (G + H)/ I

Explain the theory of computational complexity, Explain the theory of compu... Explain the theory of computational complexity A  problem's  intractability  remains  the  similar  for  all  principal  models  of   computations    and   all reasonable inpu

Representation of arrays, REPRESENTATION OF ARRAYS This is not uncommon... REPRESENTATION OF ARRAYS This is not uncommon to determine a large number of programs which procedure the elements of an array in sequence. However, does it mean that the eleme