Binary search, Computer Engineering

Assignment Help:

Binary Search

Now that the basic framework is working, it is time to begin implementing a few alternative search functions. Each of these search algorithms have strengths and weaknesses, depending on the distribution of the input and the search keys used. The classic solution to this problem is binary search. Binary search is a divide-and-conquer algorithm. See Levitin [2007] pp 162 for a detailed description of this algorithm.

ALGORITHM BinarySearch (A[0 . . . n - 1], k)
// Non-recursive binary search in an ordered list.
// INPUT : An array A[0 . . . n - 1] of ordered elements, and a search key k.
// OUTPUT : an index to the position of k in A if k is found or -1 otherwise.
1: l ← 0; r ← n - 1
2: while l ≤ r do
3: m ← ⌊(l + r)/2⌋
4: if A[m] = k then
5: return m
6: else if k < A[m] then
7: r ← m- 1
8: else

9: l ← m+ 1

10: return -1

Algorithm BinarySearch shows the pseudocode for this solution. Implement the algorithm.


Related Discussions:- Binary search

State the disadvantages of interviewing, State the Disadvantages of  inter...

State the Disadvantages of  interviewing -  can be expensive to carry out    -  can be a very time consuming exercise -  Unable to remain anonymous

C++, what is polymorphism

what is polymorphism

Explain formats supported in linux for executable programs, Explain Formats...

Explain Formats supported in Linux for executable programs. Linux supports two formats for executable programs: a. Out-binary format b. ELF - dynamic libraries

Re:- exam help, Hello there i have 4 exams of ICT and i am after a tutor wh...

Hello there i have 4 exams of ICT and i am after a tutor who can help me in those 4 subjects. One hour for each subjects will be good for me as i have sample papers ready for all s

Explain the necessary conditions for deadlock to occur, Explain the necessa...

Explain the necessary conditions for deadlock to occur. Conditions for deadlock to arise are: i. Mutual exclusion: At least one resource must be held in a non-sharable mo

Explain virtual memory, In a memory hierarchy system, data and programs are...

In a memory hierarchy system, data and programs are first stored in secondary or auxiliary memory. Program and its related data are brought in main memory for execution. What if th

Translate sentence into predicate logic - ai, Translate the following sente...

Translate the following sentences into predicate logic, using identity (=). a. Everyone was drunk except John. b. Christine rides a bike, but everyone else drives a car. c

What are the difference between heap and stack, What are the difference bet...

What are the difference between heap and stack? The Stack is more or less responsible for maintaining track of what's executing into our code or what's been "called". The Heap

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd