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

Neural networks as perceptrons, Neural networks as perceptrons: Howeve...

Neural networks as perceptrons: However ANNs look like this in the general case:  Considered that the w, x, y and z represent real valued weights so all the edges in t

Illustrate about system memory-management mode, Memory - management mode ...

Memory - management mode System memory-management mode (SMM) is on the same level as protected mode, real mode and virtual mode though it is provided to function as a manager

Quantifiers and variables - propositional model, Quantifiers and Variables ...

Quantifiers and Variables - propositional model: There is one question is arrives that 'What do sentences containing variables mean?' In other way of words, how does a first-o

Returns the information about tasks running, Returns the information about ...

Returns the information about tasks running int info = pvm_tasks( int where, int *ntask, struct pvmtaskinfo **taskp ) struct pvmtaskinfo {  int ti_tid; int ti_pt

How can a function return a pointer to its calling routine, How can a funct...

How can a function return a pointer to its calling routine? The general form of a function is: type_specifier function_name(parameter list) { body of function; }

Determine the use of loop instruction, Q. Determine the use of LOOP instruc...

Q. Determine the use of LOOP instruction? Program: This program prints the alphabets (A-Z) ; Register used: AX, CX, DX CODE SEGMENT ASSUME: CS: CODE.     MAINP:

Define range which a normalised mantissa can signify, Now let's define rang...

Now let's define range which a normalised mantissa can signify. Let's presume that our present representations has normalised mantissa so left most bit can't be zero so it has to b

Illustrate diffrent types of modems, Q. Illustrate Diffrent types of modems...

Q. Illustrate Diffrent types of modems? There are four different types of modems: half-duplex, full-duplex, synchronous, and asynchronous.With half-duplex modems data can be tr

Microcomputer applications, Mr. Franco Forest owns a small lawn care busine...

Mr. Franco Forest owns a small lawn care business with three employees. He owns the lawn mowers, rakes, and weed whackers that are housed in a storage area at the back of his home.

Show the two ways in which warnings can be suppressed in php, Show the two ...

Show the two ways in which Warnings can be suppressed in PHP? 1) Stop an individual function call from producing an error message put the @ warning suppression Operator front o

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