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

By which all systems are identified, In a LAN network every system is ident...

In a LAN network every system is identified by? In a LAN network all systems are identified through IP Address.

Define switching element for two stage non-blocking network, A two stage no...

A two stage non-blocking network requires twice the number of switching elements as the single stage non-blocking network. It is true or false. Ans: It is true that a two st

Illustrate the term extranet, Illustrate the term Extranet? Extranet:...

Illustrate the term Extranet? Extranet: Extranet is Extension of an Intranet that makes thelatter accessible to outside companies or individuals with or without an intran

Can we change the color of the worksheet tabs in my workbook, In a word,you...

In a word,you can't. It would certainly be helpful to be able to color-code your worksheet tabs. For some reason, Microsoft hasn't executed this feature, which has been available i

Mode counter, desing mode level counter starting at 0011 using D flipflop

desing mode level counter starting at 0011 using D flipflop

A* search - artificial intelligence, A* Search - artificial intelligence: ...

A* Search - artificial intelligence: A* search in the combines is the best parts of uniform cost search, namely the fact that it's optimal and complete, and the other best par

Dbms, Disadvantages of file processing system

Disadvantages of file processing system

Explain briefly the function of layers, Explain briefly the function of dif...

Explain briefly the function of different layers which are covered under end to end layer connectivity. Different layer are as follows: 1. Transport Layer:  This is res

What are bags and sequences, What are bags and sequences? A bag is a co...

What are bags and sequences? A bag is a collection of elements with duplicates permitted.  A sequence is an ordered collection of elements with duplicates permitted.

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