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

DAA, what do we use asymptotic notation in study of algorithm?Describe vari... what do we use asymptotic notation in study of algorithm?Describe various asymptotic notation and give their significance.

Stack making use of the linked list, Q. Implement a stack making use of the... Q. Implement a stack making use of the linked list. Show the PUSH and POP operations both. A n s . Stack implemantation using linked list # include # include

Define binary tree, Define Binary Tree  A binary tree T is explained as... Define Binary Tree  A binary tree T is explained as a finite set of nodes that is either empty or having of root and two disjoint binary trees TL, and TR known as, respectively

Explain Hashing, What do you mean by hashing? Hashing gives the direct ... What do you mean by hashing? Hashing gives the direct access of record from the file no matter where the record is in the file. This is possible with the help of a hashing func

Degree of node, Q. The degree of a node is defined as the number of childre... Q. The degree of a node is defined as the number of children it has. Shear show that in any binary tree, the total number of leaves is one more than the number of nodes of degree 2

Linked list implementation of any circular queue, Link list representation ... Link list representation of a circular queue is more efficient as it employs space more competently, of course with the added cost of storing the pointers. Program 7 gives the link

Types of triangular matrices, Triangular Matrices Tiangular Matrices is... Triangular Matrices Tiangular Matrices is of 2 types: a)  Lower triangular b)  Upper triangular

The two famous methods for traversing, The two famous methods for traversin... The two famous methods for traversing are:- a) Depth first traversal b) Breadth first

Order of linear search, a. In worst case the order of linear search is O (n... a. In worst case the order of linear search is O (n/2) b. Linear search is more competent than Binary search. c. For Binary search, the array must be sorted in ascending orde

Discrete time simulation of a queue, In this project you will write a progr... In this project you will write a program to produce a discrete time simulation of a queue as shown in Fig. 1. Time is slotted on the input and the output. Each input packet follows