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 visibility give uml notation, What is visibility give UML notation?...

What is visibility give UML notation? Visibility refers to the ability of a process to reference a feature from another class and has possible valued of public, private, protec

Illustrate the cache memory operation, Q. Illustrate the Cache Memory Opera...

Q. Illustrate the Cache Memory Operation? It comprises a copy of a part of main memory contents. When a program is running and CPU tries to read a word of memory (instruction o

What is ram bus technology, What is RAM Bus technology? The key feature...

What is RAM Bus technology? The key feature of RAM bus technology is a fast signalling method used to transfer information among chips. Instead of using signals that have volta

What are the uses of interactive reporting, What are the uses of interactiv...

What are the uses of interactive reporting? The user can actively control data retrieval and show during the session.  Instead of an extensive and detailed list, you make a ba

Functions - first-order logic, Functions - first-order logic: Function...

Functions - first-order logic: Functions can be thought of as exceptional predicates, wherever we think of all but one of the arguments as input and the output as final argume

Explain remote procedure call, Explain Remote Procedure Call. RPC (Remo...

Explain Remote Procedure Call. RPC (Remote Procedure Call) : The facility which was created to help the programmers write client -server software is termed as Remote Procedu

Order in which filters get implemented, If we have multiple filters implet...

If we have multiple filters impleted, what is the order in which these filters get implemented?   Ans) 1. Authorization filters 2. Response filters 3. Action filters

Explain internal organization of bit cells in a memory chip, Explain with n...

Explain with neat diagram the internal organization of bit cells in a memory chip. Memory cells are usually organized in the form of an array, in which every cell is capable of

Explain approaches to identify free memory area in a heap, Discuss two main...

Discuss two main approaches to identify free memory area in a heap. Two popular systems to identify free memory areas as a result of allocation and de-allocations in a heap are

Calculate the switching elements in a two stage network, In a two stage ne...

In a two stage network there are 512 inlets and outlets, r=s=24. If the probability that a given inlet is active is 0.8, calculate: the switching elements Given: N =M =512,

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