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

Deletion algorithm for dequeue, Deletion Algorithm for dequeue Step 1:... Deletion Algorithm for dequeue Step 1: [check for underflow]   If front = 0 and rear = 0   Output "underflow" and return Step 2: [delete element at front end]   If front

Structure of an avl tree, Given is the structure of an AVL tree: struct ... Given is the structure of an AVL tree: struct avl { struct node *left; int info; int bf; struct node *right; }; 2) A multiway tree of n order is an ord

Algorithm for pre-order traversal, Hear is given a set of input representin... Hear is given a set of input representing the nodes of a binary tree, write a non recursive algorithm that must be able to give the output in three traversal orders. Write down an

Ways to implement abstract data types, Ways to implement abstract data type... Ways to implement abstract data types A large part of the study of data structures and algorithms is learning about alternative ways to implement an ADT and evaluating alternat

State an algorithm which inputs 3 - digit code for 280 items, A small shop ... A small shop sells 280 different items. Every item is identified by a 3 - digit code. All items which start with a zero (0) are cards, all items which start with a one (1) are swee

Algorithm, write an algorithm for the gpa of six students write an algorithm for the gpa of six students

Adjacency list representation, Adjacency list representation An Adjacen... Adjacency list representation An Adjacency list representation of Graph G = {V, E} contains an array of adjacency lists mentioned by adj of V list. For each of the vertex u?V,

Example of single node with multiple elements, The class Element represents... The class Element represents a single node that can be part of multiple elements on a hotplate and runs in its own thread. The constructor accepts the initial temperature and a hea

Graph & optimal scheduling, You are given an undirected graph G = (V, E) in... You are given an undirected graph G = (V, E) in which the edge weights are highly restricted. In particular, each edge has a positive integer weight of either {1,2,...,W}, where W

Structured programming, What do you understand by term structured programmi... What do you understand by term structured programming? Explain the structured programming as well.                                 Ans. S tructured Programming is expla