Ask a Question

  1. Home
  2. Ask a Question
  3. Question Details
Doubts ?
Post a question
Ask Us

Categories

algo to search for an element in an array using binary search

on 2012-10-01 01:17:22   by Priyanka   on Information Technology  1 answers

Rajni

on 2012-10-03 09:30:00  

BinarySearch(A; a; b; x) INPUT: a; b integers, A[a::b] array of real numbers, x real number. if b < a then print \list empty," exit l := a; u := b (initializing lower and upper limits of current range) while l < u p := b(l + u)=2c (pivot) if x  A[p] then u := p else l := p + 1 end(while) if x = A[l] then return l, print "found," exit print "not found," exit