can selection be done in O(n) expected time. if the size of the input is n...
can selection be done in O(n) expected time. if the size of the input is n . If so how does it to be done? Analyse your algorithm
Homework Answers
Yes, selection can be done in O(n) expected time.
There is a algorithm called as quick select that gives the required result.
This algorithm is based on quick sort algorithm but it stops when the pivot element is the kth element that we need to find. So average it takes O(n) expected time.
Add Answer to:
can selection be done in O(n) expected time. if the size of the
input is n...
Suppose that an algorithm has run-time proportional to 2n , where n is the input size....
Suppose that an algorithm has run-time proportional to 2n , where n is the input size. The algorithm takes 1 millisecond to process an array of size 10. How many milliseconds would you expect the algorithm take to process an array of size 20 ?
Assume that an O(log2N) algorithm runs for 10 milliseconds when the input size (N) is 32....
Assume that an O(log2N) algorithm runs for 10 milliseconds when the input size (N) is 32. What is input size makes the algorithm run for 14 milliseconds?
We know that binary search on a sorted array of size n takes O(log n) time....
We know that binary search on a sorted array of size n takes O(log n) time. Design a similar divide-and-conquer algorithm for searching in a sorted singly linked list of size n. Describe the steps of your algorithm in plain English. Write a recurrence equation for the runtime complexity. Solve the equation by the master theorem.
QUESTION 5 A program P takes time proportional to n log n where n is the...
QUESTION 5 A program P takes time proportional to n log n where n is the input size. If the program takes 4 seconds to process input of size 100,000,000, how many microseconds does it take to process input of size 10,000? QUESTION 6 algorithm An example of a graph problem that can be solved in polynomial time is (Hint: Starts with 'D' You're allowed to research this one online if you don't know it.)
algorithm’s complexity is measured on input size instead of input values. Please indicate the input size...
algorithm’s complexity is measured on input size instead of input values. Please indicate the input size for an algorithm that solves the following problem: Given: a number n and two primes p, q, Question: is it the case that n = p · q? So I want a help Determining the input size.
Design an algorithm for the following description. Solution can be done in pseudo-code or steps of...
Design an algorithm for the following description. Solution can
be done in pseudo-code or steps of the algorithm.
Describe and analyze an algorithm that takes an unsorted array A of n integers (in an unbounded range) and an integer k, and divides A into k equal-sized groups, such that the integers in the first group are lower than the integers in the second group, and the integers in the second group are lower than the integers in the third group,...
Let T(n) denote the worst case running time of an algorithm when its input has size...
Let T(n) denote the worst case running time of an algorithm when its input has size n. In divide and conquer algorithms, T(n) is often expressed using a recursion. Hence, expressing T(n) in terms of the big-Oh notation requires a bit of work. There are many ways of determining the growth rate of T(n). In class, I’ve shown you how to do it by drawing the recursion tree. Here are the steps: (1) draw the recursion tree out, (2) determine...
Using the pseudocode answer these questions Algorithm 1 CS317FinalAlgorithm (A[O..n-1]) ito while i<n - 2 do...
Using the pseudocode answer these questions
Algorithm 1 CS317FinalAlgorithm (A[O..n-1]) ito while i<n - 2 do if A[i]A[i+1] > A[i+2) then return i it i+1 return -1 4. Calculate how many times the comparison A[i]A[i+1] > A[i+2] is done for a worst-case input of size n. Show your work. 5. Calculate how many times the comparison A[i]A[i+1] > A[i+2] is done for a best-case input of size n. Show your work.
Suppose the following is a divide-and-conquer algorithm for some problem. "Make the input of size n...
Suppose the following is a divide-and-conquer algorithm for some problem. "Make the input of size n into 3 subproblems of sizes n/2 , n/4 , n/8 , respectively with O(n) time; Recursively call on these subproblems; and then combine the results in O(n) time. The recursive call returns when the problems become of size 1 and the time in this case is constant." (a) Let T(n) denote the worst-case running time of this approach on the problem of size n....
A divide-and-conquer algorithm solves a problem by dividing the input (of size n>1, T(1) =0) into...
A divide-and-conquer algorithm solves a problem by dividing the input (of size n>1, T(1) =0) into two inputs half as big using n/2-1 steps. The algorithm does n steps to combine the solutions to get a solution for the original input. Write a recurrence equation for the algorithm and solve it.
QUESTION 5 A program P takes time proportional to n log n where n is the input size. If the program takes 4 seconds to process input of size 100,000,000, how many microseconds does it take to process input of size 10,000? QUESTION 6 algorithm An example of a graph problem that can be solved in polynomial time is (Hint: Starts with 'D' You're allowed to research this one online if you don't know it.)
Design an algorithm for the following description. Solution can
be done in pseudo-code or steps of the algorithm.
Describe and analyze an algorithm that takes an unsorted array A of n integers (in an unbounded range) and an integer k, and divides A into k equal-sized groups, such that the integers in the first group are lower than the integers in the second group, and the integers in the second group are lower than the integers in the third group,...
Using the pseudocode answer these questions
Algorithm 1 CS317FinalAlgorithm (A[O..n-1]) ito while i<n - 2 do if A[i]A[i+1] > A[i+2) then return i it i+1 return -1 4. Calculate how many times the comparison A[i]A[i+1] > A[i+2] is done for a worst-case input of size n. Show your work. 5. Calculate how many times the comparison A[i]A[i+1] > A[i+2] is done for a best-case input of size n. Show your work.
Most questions answered within 3 hours.
-
The denaturation of proteins can be described by the
equilibrium
F⇌U
where F and U represent...
asked 46 minutes ago -
Please answer what the maximum and minimum force is, and the
angle on the ion is...
asked 48 minutes ago -
implement a program that reads a number of rows and a symbol.
The program will draw...
asked 53 minutes ago -
Assume that when adults with smartphones are randomly selected,
45% use them in meetings or classes....
asked 57 minutes ago -
Determine the number of formula units of
Na2SO4 and moles of oxygen contained in 8.11
moles...
asked 1 hour ago -
Explain in steps on the following code
What would be the output when executed
using System;...
asked 1 hour ago -
Given the information in the table, which of the following
statements is CORRECT?
Stock A
Stock...
asked 1 hour ago -
Write MARIE assembly language programs that do the following:
Write a program that inputs an integer...
asked 1 hour ago -
Explain an understanding of services and protocols.
Explain the job of DNS.
Explain the three email...
asked 1 hour ago -
(As soon as possible) Balance each of the following equations
according to the half-reaction method:
H2O2(aq)...
asked 1 hour ago -
A thin rod with a mass of 3.5kg and a length L=1.5 m is oriented
horizontally....
asked 1 hour ago -
Inheritance pattern in BRCA 1
Describe the inheritance pattern of BRCA 1 Is it recessive or...
asked 1 hour ago