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

Give the syntax of if-else statement, Give the syntax of "if-else" and "sw...

Give the syntax of "if-else" and "switch" statements and explain. if else This is used to decide whether to do something at a special point, or to decide between two courses

Operation of micro controller, Consider the hardware design as shown. Withi...

Consider the hardware design as shown. Within the target system the EPROM would contain the hex data as shown below   Address  Assembly code   8000             86   8001

Process of interaction design, This unit starts by discussing the importanc...

This unit starts by discussing the importance of involving users in the interaction design process, explaining the reasons why user involvement can be useful, the different degrees

Explain pre-emptive scheduling, Explain Pre-emptive scheduling? Pre-em...

Explain Pre-emptive scheduling? Pre-emptive scheduling: in its approach, center processing unit can be taken away from a process if there is a require while in a non-pre-empt

Define critical mass and critical volume, Q. Define critical mass and criti...

Q. Define critical mass and critical volume? The minimum size in which at least one neutron is available for further fission reaction. The throng of the fissile material at the

Comparison between motorola processors and intel processors, Comparison bet...

Comparison between Motorola processors and INTEL processors: Intel/AMD processors are really about the same thing.  They run the same software and operate in a very similar ma

Explain frequency division multiplexing, Explain FDM and show how CCITT sta...

Explain FDM and show how CCITT standards help in building the base band? Frequency Division Multiplexing: This is the process of combining some information channels through s

Illustrate about direct addressing mode, Q. Illustrate about Direct Address...

Q. Illustrate about Direct Addressing mode? In this technique operand field of instruction specifies direct address of intended operand for example if instruction LOAD 500 uses

Performance evaluation-parallel computing, Performance Evaluation In th...

Performance Evaluation In this part, we talk about the primary attributes used to measure the performance of a computer system. Unit 2 of block 3 is totally devoted to performa

What layers are covered under end to end layer connectivity, What layers ar...

What layers are covered under end to end layer connectivity? The layers 4 to 7 of ISO-OSI reference model communicate along with peer entities into the end systems. There is n

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