Consider a sequential search algorithm. Given a value, the algorithm scans a linear arrayuntil the value is found. If the value is not found, that algorithm returns a fail code (a) What is the best-case running time of this algorithm? Give the tightest asymptoticbound on the best-case running time using O notation.(b) What is the worst-base running time of this algorithm? Give the tightest asymptoticbound on the worst-case running time using O notation.

Linear Search: The simplest search algorithm is linear Search. It sequentially traverses the array…

Answered: Consider a sequential search algorithm.…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

aolve algorithm Suppose that you are attending a one day conference in which several lectures are presented in parallel sessions e, more than one lecture may by running at the same timej. Lectures may be of different lengths. The lectures schedule is given to you in an array L such that Ld is the D of a lecture, L stort is the starting time of that lecture and Lend is the end time of that lecture. If you attend a lecture, you must atmtend it from the beginning until the end of it lyou are not allowed to amend lectures partialy. You want to amend as many lectures as possible. a) Give the pseudocode of an algorithm that takes as input the array Land finds the maximum number of lectures that you can attend. You can assume that dthe starting times and end times are integers representing time. The conterence sarts at time 0 and ends at some times. If you need to use a binary search algorithm or a sorting algorithm you can just calwithout gving s peudocode. fyou need to use any other…
Prime numbers can also be generated by an algorithm known as the Sieve of Eratosthenes . The algorithm for this procedure is presented here. Write a program that implements this algorithm so as to find all prime numbers up to n = 150. Sieve of Eratosthenes Algorithm To Display All Prime Numbers Between 1 and n Step 1: Define an array of integers P . Set all elements P i to 0, 2 <= i <= n. Step 2: Set i to 2. Step 3: If i > n , the algorithm terminates. Step 4: If P i is 0 (value i is a prime number), then i is prime and display its value. Step 5: For all positive integer values of j , such that i * j ≤ n , set P i ∗ j to 1 (non - prime). Step 6: Add 1 to i and go to step 3
If a linear search is performed on an array, and it is known that some items are searched for more frequently than others, how can the contents of the array be reordered to improve the average performance of the search?
2. An interpolation search assumes that the data in an array is sorted and uniformly distributed.Whereas a binary search always looks at the middle item in an array, an interpolation searchlooks where the sought-for item is more likely to occur. For example, if you searched yourtelephone book for Victoria Appleseed, you probably would look near its beginning ratherthan its middle. And if you discovered many Appleseeds, you would look near the lastAppleseed. Instead of looking at the element a[mid] of an array a, as the binary search would,an interpolation search examines a[index], where p = (desiredElement - a[first]) / (a[last] - a[first]) index = first + [(last – first) × p]Implement an interpolation search of an array. For particular arrays, compare the outcomesof an interpolation search and of a binary search. Consider arrays that have uniformlydistributed entries and arrays that do not. Modify and save the file asSearchComparerYourlastname.java.
Quicksort is a powerful divide-and-conquer sorting algorithm that can be described in just four lines ofpseudocode. The key to Quicksort is the PARTITION(A, p, r) procedure, which inputs elementsptorof array A,and chooses the final element x = A[r] as the pivot element. The output is an array where all elementsto the left ofxare less thanx, and all elements to the right of x are greater than x. In this question, we will use the Lomuto Partition Method from class and assume that the pivot isalwaysthe last (right-most) element of the input array. Question: Let A be an array withn= 2k−1 elements, where k is some positive integer. Determine a formula (in terms of n) for the minimum possible number of total comparisons required by Quicksort, as well as a formula for the maximum possible number of total comparisons required by Quicksort. Use your formulas to show that the running time of Quicksort is O(nlogn) in the best case and O(n2) in the worst case.
Assume that we have a sorted list in an array: Index: 0 1 2 3 4 5 6 7 8 9 10 11 numbers: 12 15 17 19 22 26 28 30 32 34 36 38 we want to use the binary search algorithm to find the value 19 in the list. What would be the indexes of the array that the binary search would check to find the value 19 the indexes and not the actual numbers in the list otherwise
Assume that you are given an array containing n integer numbers from the set {0, 1, . . . , k} for some k ≤ n. Design an algorithm to produce a sorted array containing those n numbers in non-decreasing order in time O(n). Present the pseudocode for the algorithm and provide a justification for its running time.
A school uses the array to call an attendance register every morningWrite an algorithm using iteration to:• display the name of each student one at a time from studentnames• take as input whether that student is present or absent• display the total number of present students and number of absent students in asuitablemessage, after all student names have been displayed.
Please choose the answer and give the reasoning for it. The sequential search algorithm: 1. Requires the array to be ordered 2. Must always be implemented as a method 3. Uses a loop to step through an array, starting with the first element 4. Will not execute if the element is not in the array
Write the algorithm which finds the second maximum value of the array. Then find the complexity of the algorithm as Big O notation
The worst-case for the sequential search algorithm is when the item is:
While the sequential search algorithm and the binary search algorithm both have their uses, it is unclear whether it is best to use one over the other.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS