Exponential search, Computer Engineering

Assignment Help:

Exponential Search

Another alternative to variable size decrease-and-conquer search is known as exponential search. This algorithm begins searching at the beginning of the list. It then progressively tests at larger intervals (A[2],A[4],A[8], . . .) until a straddling range is found which may contain the search value. A binary search is then performed on only the suspect range to ?nd the ?nal index position.

ALGORITHM ExponentialSearch (A[0 . . . n - 1], k)

// A variable-size decrease and conquer 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: set pos ← 2
2: while pos < n and A[pos] < k do
3: prev ← pos
4: pos ← pos  2
5: if pos > n - 1 then
6: pos ← n - 1
7: result ← BinarySearch(A[prev . . . pos], k)
8: if result = -1 then
9: return -1
10: else
11: return result + prev

Algorithm ExponentialSearch shows the pseudocode for this solution. Implement the algorithm.


Related Discussions:- Exponential search

Evaluate physical address of top of stack, Q. Evaluate Physical address of ...

Q. Evaluate Physical address of top of stack? Value of stack segment register (SS) = 6000h Value of stack pointer (SP) which is Offset = 0010h  So Physical address of top

Give brief description about arithmetic processing unit, Give brief descrip...

Give brief description about arithmetic processing unit To execute the arithmetic operations there is a separate section known as arithmetic processing unit in CPU. The arithme

Applications of parallel processing, Applications Of Parallel Processing ...

Applications Of Parallel Processing Parallel computing is an development of serial computing that effort to emulate what has always been the affirm of affairs in the natural wo

Pre order given find post order ?, The preorder traversal sequence of a bin...

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?

What is an accessor in c++, An accessor is a class operation that does not ...

An accessor is a class operation that does not change the state of an object in C++. The access or functions require to be declared as const operations

Which TTL logic gate is used for wired anding, Which TTL logic gate is used...

Which TTL logic gate is used for wired ANDing ? Ans. Open collector output, TTL logic gate is used.

Explain mutual-exclusion implementation with semaphores, Disadvantage and...

Disadvantage and Advantage of mutual-exclusion implementation with semaphores. Disadvantage: Mutual-exclusion solutions specified by semaphores require busy waiting. Tha

Two ways in which one can retrieve data from tables, In general what are th...

In general what are the two ways in which one can retrieve data from tables? Using Select statements, Database Program.

Explain floating point arithmetic pipelines, Floating point Arithmetic pipe...

Floating point Arithmetic pipelines Floating point calculations are the best candidates for pipelining. Take the illustration of addition of two floating point numbers. Subsequ

What is a sap system, What is a SAP system? The union of all s/w compo...

What is a SAP system? The union of all s/w components that are assigned to the similar databases is known as a SAP system.

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