Q. Write down the algorithm for binary search. Which are the conditions under which sequential search of a list is preferred over the binary search?                                                                   

Ans.

Algorithm for the Binary Search is as follows

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]

Sequential Search is preferred over the binary search when the list is disorder and haphazardly constructed. When searching is to be done on unsorted list then linear search is the only option.

Posted Date: 7/12/2012 8:44:24 AM | Location : United States

Ask an Expert

Related Discussions:- Algorithm for binary search, Assignment Help, Ask Question on Algorithm for binary search, Get Answer, Expert's Help, Algorithm for binary search Discussions

Write discussion on Algorithm for binary search
Your posts are moderated

Write your message here..

Related Questions

Convertion, how we can convert a graph into tree how we can convert a graph into tree

Prefix and Postfix Expressions, Q.   Draw the expression tree of the infix ... Q.   Draw the expression tree of the infix expression written below and then  convert it intoPrefix and Postfix expressions. ((a + b) + c * (d + e) + f )* (g + h )

Infix expression to postfix form using the stack function, Q. Convert the f... Q. Convert the following given Infix expression to Postfix form using the stack function: x + y * z + ( p * q + r ) * s , Follow general precedence rule and suppose tha

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

Surrounding of sub division method, Surrounding of sub division method ... Surrounding of sub division method A polygon surrounds a viewport if it completely encloses or covers the viewport. This happens if none of its sides cuts any edge of the viewp

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

Introduction, what are avl trees what are avl trees

Using array to execute the queue structure, Q. Using array to execute the q... Q. Using array to execute the queue structure, write down an algorithm/program to (i) Insert an element in the queue. (ii) Delete an element from the queue.

A difference between linear and non linear, state difference between linear... state difference between linear and non linear data structure. give one example scenario of each

Time complexity, how to learn about time complexity of a particular algorit... how to learn about time complexity of a particular algorithm