Homework Answers
This median Select algorithm splits the entire data into small tasks and it starts sorting of each task invidually.
4th line for i=1 to lim do .. this
line will split data into small tasks.
7th line for j=1 to n do ... this line
sort data linearly...
So sorting this small lists take linear complexity O(n) for n elements. So on average , best and worst case it take O(n) complexity.
Add Answer to:
Analyze the time complexity of the following algorithm. You may assume that the floor function in...
Consider the following: Algorithm 1 Smallest (A,q,r) Precondition: A[ q, ... , r] is an array...
Consider the following: Algorithm 1 Smallest (A,q,r) Precondition: A[ q, ... , r] is an array of integers q ≤ r and q,r ∈ N. Postcondition: Returns the smallest element of A[q, ... , r]. 1: function Smallest (A , q , r) 2: if q = r then 3: return A[q] 4: else 5: mid <--- [q+r/2] 6: return min (Smallest(A, q, mid), Smallest (A, mid + 1, r)) 7: end if 8: end function (a) Write a recurrence...
Use a loop invariant to prove that the following algorithm correctly identifies the location of the...
Use a loop invariant to prove that the following algorithm correctly identifies the location of the minimum value in the array data. Input: data: array of integers Input: n: size of data Output: index min such that data[min] <= data[i] for any i from 1 to n Algorithm: FindMin min = 1; for i = 2 to n do if data[i] < data[min] then min = i; end end return min
What is the worst-case asymptotic time complexity of the following divide-andconquer algorithm (give a Θ-bound). The...
What is the worst-case asymptotic time complexity of the following divide-andconquer algorithm (give a Θ-bound). The input is an array A of size n. You may assume that n is a power of 2. (NOTE: It doesn’t matter what the algorithm does, just analyze its complexity). Assume that the non-recursive function call, bar(A1,A2,A3,n) has cost 3n. Show your work! Next to each statement show its cost when the algorithm is executed on an imput of size n abd give the...
What is the worst-case asymptotic time complexity of the following divide-andconquer algorithm (give a Θ-bound). The...
What is the worst-case asymptotic time complexity of the following divide-andconquer algorithm (give a Θ-bound). The input is an array A of size n. You may assume that n is a power of 2. (NOTE: It doesn’t matter what the algorithm does, just analyze its complexity). Assume that the non-recursive function call, bar(A1,A2,A3,n) has cost 3n. Show your work! Next to each statement show its cost when the algorithm is executed on an imput of size n abd give the...
Below is a linear time complexity algorithm Max-Min-VER1 to find the biggest and smallest element a...
Below is a linear time complexity algorithm Max-Min-VER1 to find the biggest and smallest element a given list. Input: A is a given list Output: two integers Example: Given A = {1, 5, 9, -3}. It returns -3 (the smallest element), and 9 (the biggest element) Max-Min-VER1(A, n) Line 1: large ← A[0] Line 2: for I from 1 to n - 1 do Line 3: large ← Math.max(large, A[I]) Line 4: small ← A[0] Line 5: for I from...
In Java Language Write a recurrence equation expressing the time complexity of the following algorithm. Explain...
In Java Language Write a recurrence equation expressing the time complexity of the following algorithm. Explain your answer. Assume that n is a power of 2. Algorithm rec(n) Input: Integer value n ≥ 0 if n = 0 then return 1 else { c ← 0 For i ← 0 to n−1 do c ← c + i c ← c + rec(n/2) return c }
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1...
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1 ) return b; else return RecursiveFunction (a-2, a/2); endif a. What is the time complexity of the RecursiveFunction pseudocode shown above? b What is the space complexity of the RecursiveFunction pseudocode shown above? n(n+1) C. What is the time complexity of the following algorithm (Note that 21-, i = n(n+1)(2n+1). and Σ.,1 ): Provide both T(n) and order, Ofn)). int A=0; for (int i=0;i<n;i++)...
What is the time-complexity of the algorithm abc? Procedure abc(n: integer) s := 0 i :=1...
What is the time-complexity of the algorithm abc? Procedure abc(n: integer) s := 0 i :=1 while i ≤ n s := s+1 i := 2*i return s consider the following algorithm: Procedure foo(n: integer) m := 1 for i := 1 to n for j :=1 to i2m:=m*1 return m c.) Find a formula that describes the number of operations the algorithm foo takes for every input n? d.)Express the running time complexity of foo using big-O/big-
Exercise 7.3.5: Worst-case time complexity - mystery algorithm. The algorithm below makes some changes to an...
Exercise 7.3.5: Worst-case time complexity - mystery algorithm. The algorithm below makes some changes to an input sequence of numbers. MysteryAlgorithm Input: a1, a2....,an n, the length of the sequence. p, a number Output: ?? i != 1 j:=n While (i < j) While (i <j and a < p) i:= i + 1 End-while While (i <j and a 2 p) j:=j-1 End-while If (i < j), swap a, and a End-while Return( aj, a2,...,an) (a) Describe in English...
Analyze the worst-case complexity of the algorithm below when using an optimized adjacency list to store...
Analyze the worst-case complexity of the algorithm below when using an optimized adjacency list to store G. ComponentCount: Input: G = (V, E): an undirected graph with n vertices and m edges Input: n, m: the order and size of G, respectively Output: the number of connected components in G Pseudocode: comp = n uf = UnionFind(n) For v in V: For u in N(v): If (uf.Find(v) != uf.Find(u)) uf.Union(u, v) comp = comp - 1 End if End for...
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1 ) return b; else return RecursiveFunction (a-2, a/2); endif a. What is the time complexity of the RecursiveFunction pseudocode shown above? b What is the space complexity of the RecursiveFunction pseudocode shown above? n(n+1) C. What is the time complexity of the following algorithm (Note that 21-, i = n(n+1)(2n+1). and Σ.,1 ): Provide both T(n) and order, Ofn)). int A=0; for (int i=0;i<n;i++)...
Exercise 7.3.5: Worst-case time complexity - mystery algorithm. The algorithm below makes some changes to an input sequence of numbers. MysteryAlgorithm Input: a1, a2....,an n, the length of the sequence. p, a number Output: ?? i != 1 j:=n While (i < j) While (i <j and a < p) i:= i + 1 End-while While (i <j and a 2 p) j:=j-1 End-while If (i < j), swap a, and a End-while Return( aj, a2,...,an) (a) Describe in English...
Most questions answered within 3 hours.
-
You are a statistician and wish to estimate, with 90%
confidence, the proportion of adults who...
asked 2 hours ago -
A man is standing 3.40 m in front of a convex spherical mirror
of radius of...
asked 2 hours ago -
Match the annual percentage rate to each of these trade credit
terms:
__ 1/5, NET 60...
asked 2 hours ago -
ORGANIC CHEMISTRY QUESTION 5
PART A--------
Describe a chemical test for the identification of a double...
asked 6 hours ago -
Both Terence and Tong work at a local actuarial consulting firm
in Des Moines.
Terence arrives...
asked 6 hours ago -
QUESTION 11
. THE RESTING POTENTIAL IS CAUSED BY
.
. A.
. the rotation of...
asked 6 hours ago -
Need them in c++
1. Give the code for the
definition of a node for
the linked implementation of
a tree that contains...
asked 6 hours ago -
For sputtering-cleaning and sputter-depositing a metal,
would you use an AC or DC plasma? Explain your...
asked 6 hours ago -
Defend ONE of the following statements:
Prices should reflect the value consumers are willing to
pay....
asked 6 hours ago -
A magnet of mass 0.10 kg is dropped from rest and falls
vertically through a 20.0...
asked 6 hours ago -
A friend approaches you about a nutritional product and ask you
if it is worth it....
asked 6 hours ago -
What is bacterial transformation? What are the differences and
similarities between transforming a bacterial cell with...
asked 7 hours ago