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

Define html, HTML is a Hyper text Markup Language and it is  Scripting La...

HTML is a Hyper text Markup Language and it is  Scripting Language

Details of load sharing facility resource management, Primary objectives/de...

Primary objectives/details of Load Sharing Facility Resource Management Software (LSFRMS) are better resource utilisation by routing task to most suitable system as well a better u

Define virtual memory, Normal 0 false false false EN-IN...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

What is connection, An established communication session among a server and...

An established communication session among a server and a workstation.

Describe about instruction set, Q. Describe about Instruction set? Inst...

Q. Describe about Instruction set? Instruction set is the boundary where computer designer and computer programmer see the same computer from various viewpoints. From the desig

Explain intermediate representation, a. Explain Intermediate Representation...

a. Explain Intermediate Representation? What are the desirable properties of Intermediate Representation? b. Explain Grammar of a language. Identify the dissimilar classes of gr

Name the processes of oom, Name the processes of OOM In OOM the modelli...

Name the processes of OOM In OOM the modelling passes through the given processes: System Analysis System Design Object Design, and Final Implementation.

Illustrated three stages of data mining process, Illustrated three stages o...

Illustrated three stages of data mining process? Stage 1: Exploration: This stage generally starts along with data preparation that may involve cleaning data, selecting subse

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