Assume that we have a single list of length 16 that we want to search k times. If we use a sorting algorithm that takes at worst () comparisons, for what values of k will the worst case number of comparison for first sorting the list once and then using binary search k times be better than using a linear search k times? Be sure to show/explain your work.

Assume that we have a single list of length 16 that we want to search k times. If we use a sorting algorithm that takes at worst () comparisons, for what values of k will the worst case number of comparison for first sorting the list once and then using binary search k times be better than using a linear search k times? Be sure to show/explain your work.

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

Given a linked list L storing n integers, present an algorithm (either in words or in a pseudocode) that decides whether L contains any 0 or not. The output of your algorithm should be either Yes or No. What is the running time of your algorithm in the worst-case, using O notation?
We talked about the trade-off between using sequential search on an unsorted list as opposed to sorting the list and then using binary search. If the list size is n = 9,000, about how many worst-case searches must be done before the second alternative is better in terms of number of comparisons? (Hint: Let p represent the number of searches done.) Use selection search to sort the binary search list.
we talked aboutthe trade-off between using sequential searchon an unsorted list as opposed to sorting thelist and then using binary search. If the list sizeis n = 9,000, about how many worst-casesearches must be done before the secondalternative is better in terms of number ofcomparisons? (Hint: Let p represent thenumber of searches done.
When the number of elementary events n is small, we could implement row 10 inAlgorithm 2.3 with a simple sequential search. The efficiency of the whole algorithmdepends on how fast this linear search finds the smallest index i for which Si−1 <k ≤ Si. How would you organize the weight sequence W before the prefix sums arecalculated? To verify your solution, implement a program that finds a permutationfor the given weight sequence that minimizes the average number of the requiredsequential steps (i.e. increments of i). Also try out different distribution
Consider median-3 quick sort and bubble sort. When using these two algorithms to sort a list of n elements that have already been sorted in increasing order, which of the following is true for the worst-case time complexity?
Given a set of n numbers, we wish to find the i largest in sorted order using a comparison-based algorithm. Find the algorithm that implements each of the following methods with the best asymptotic worst-case running time, and analyze the running times of the algorithms in terms of n and i. a. Sort the numbers, and list the i largest. Group of answer choices 1. O(ni) 2. O(nlg(n)) 3. O(n + ilg(n)) 4. O(i + nlg(n)) 5. O(n + ilg(i)) b. Build a max-priority queue from the numbers, and call EXTRACT-MAX i times. Group of answer choices 1. O(i + nlg(n)) 2. O(n + ilg(n)) 3. O(nlg(n)) 4. O(ni) 5. O(n + ilg(i)) c. Use an order-statistic algorithm to find the ith largest number, partition around that number, and sort the i largest numbers. Group of answer choices 1. O(n + ilg(i)) 2. O(n + ilg(n)) 3. O(nlg(n)) 4. O(i + nlg(n)) 5. O(ni)
Suppose we have the following sorted set of positive integers: 1 2 4 4 6 7 9 9 15 18 22. Also assume that we use linear search (starting from the left as normal) and searching for element 10. How many comparisons are needed at least then before we come to the conclusion that the element is not in the set? 10 true 8 true 9 true
We argued in class that if the input is not uniformally distributed, the worst-case running time of Bucket Sort (using Insertion Sort in each bucket) in O(n^2). The reason: all those numbers could fall in the same bucket, and then the time of Insertion sorting then dominates. How many out of the total n numbers could fall in one bucket and the algorithm still run in linear time if the rest are evenly distributed? (Choose one option, no points if you choose more than one.) A. O(1)B. O(√n)C. O(On)D. O(log n)E. None of the above
Considering the search problem, we have a list of ?n integers ?=⟨?1,?2,⋯??⟩A=⟨v1,v2,⋯vn⟩. We want to design an algorithm to check whether an item ?v exists or not such that it should return either the index, ?i, if it was found or −1−1 otherwise, when not found.
Suppose we are given two sorted arrays A and B which each contain n elements. Give an O(log n) time divide-and-conquer algorithm which finds the median of A ∪ B.
This assignment is an exercise in finding the average-case complexity of an algorithm.Rather than looking at how long an algorithm can run in the worst case as in worst-case analysis, we are looking at how long an algorithm runs on average. This is doneby computing the average number of comparisons and operations executed until thealgorithm ends.Bogosort is a sorting algorithm that orders a list in increasing order by taking thelist, checking to see if the list is ordered increasingly, if the list is not ordered increasinglythen the list is randomly shuffled, and then repeating this process until the list is orderedincreasingly.Expressed in pseudocode:Algorithm 1 BogosortRequire: list: a1, a2, . . . , an of real numbersEnsure: list is sorted in increasing order1: procedure bogo(list)2: while not sorted(list) do ▷ Checks to see if list is sorted3: shuffle(list) ▷ Shuffle the current list if not sorted4: end while5: end procedure Problem: Consider the Bernoulli trial where a success is…
This assignment is an exercise in finding the average-case complexity of an algorithm.Rather than looking at how long an algorithm can run in the worst case as in worst-case analysis, we are looking at how long an algorithm runs on average. This is doneby computing the average number of comparisons and operations executed until thealgorithm ends.Bogosort is a sorting algorithm that orders a list in increasing order by taking thelist, checking to see if the list is ordered increasingly, if the list is not ordered increasinglythen the list is randomly shuffled, and then repeating this process until the list is orderedincreasingly.Expressed in pseudocode:Algorithm 1 BogosortRequire: list: a1, a2, . . . , an of real numbersEnsure: list is sorted in increasing order1: procedure bogo(list)2: while not sorted(list) do ▷ Checks to see if list is sorted3: shuffle(list) ▷ Shuffle the current list if not sorted4: end while5: end procedure We will now find the average-case time complexity for…