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

What is asp.net authentication providers and iis security, What is ASP.NET ...

What is ASP.NET Authentication Providers and IIS Security? ASP.NET implements authentication using authentication providers, which are code modules that verify credentials and

Can a structure be used within a structure, Can a structure be used within ...

Can a structure be used within a structure? Yes , a structure can be used within a structure known as nesting of structures.

How do you make an image clickable in HTML, How do you make an image clicka...

How do you make an image clickable in HTML? Give an example. To create an image or text clickable hyperlinks are used, that use the and tags. Such tag has different paramet

Explain the term- cycle based simulator, Explain the term- Cycle Based Simu...

Explain the term- Cycle Based Simulator This is a Digital Logic Simulation method which eliminates unnecessary calculations to achieve huge performance gains in verifying Bool

Explain step by step switching system with neat diagram, With the help of a...

With the help of a neat diagram explain a step by step switching system. Configuration of a step by step switching system: A step by step switching system may be constr

Why java is called machine independent, Why Java is called Machine Independ...

Why Java is called Machine Independent? While a java program is compiled this is not converted in an executable code. Rather, this is converted in a byte code. Byte code is hig

Illustrate when are intermolecular forces the strongest, Q. Illustrate when...

Q. Illustrate when are intermolecular forces the strongest? Answer:- Intermolecular forces dispersion and dipole-dipole and hydrogen bonds. These forces are feeble than ch

Methods for organising the associative memory, There are two methods for or...

There are two methods for organising the associative memory based on bit slices: Bit parallel organisation: In this organisation every bit slices which are not masked off,

What are the benefits of using asp.net routing, In an ASP.NET web applicati...

In an ASP.NET web application that does not build use of routing, an incoming browser request should map to a physical file. If the file does not exist, we get page not found error

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