Homework Answers
For each value of A, it is searching in B. So basically this algorithm finding the comman elements.
Here we have two do while loop. One is nested in other.
Since size of A and B is n.
So, T(n) = 1 + 2+ 3+ ...+n = n(n+1)/2 = O(n^2)
Add Answer to:
Algorithm performance Give the order of magnitude Theta () for the following algorithm. Explain why your...
The following algorithm (Rosen pg. 363) is a recursive version of linear search, which has access...
The following algorithm (Rosen pg. 363) is a recursive version of linear search, which has access to a global list of distinct integers a_1, a_2,..., a_n. procedure search(i, j, x : i,j, x integers, 1 < i < j < n) if a_i = x then return i else if i = j then 4. return 0 else return search(i + 1, j, x) Prove that this algorithm correctly solves the searching problem when called with parameters i = 1...
Discrete Math Give a big-Theta estimate for the number of additions in the following algorithm a)...
Discrete Math
Give a big-Theta estimate for the number of additions in the following algorithm a) procedure f (n: integer) bar = 0; for i = 1 to n^3 for j = 1 to n^2 bar = bar + i + j return bar b) Consider the procedure T given below. procedure T (n: positive integer) if n = 1 return 2 for i = 1 to n^3 x = x + x + x return T(/4) + T(/4) +...
3. Recursive Program (6 points) Consider the following recursive function for n 1: Algorithm 1 int...
3. Recursive Program (6 points) Consider the following recursive function for n 1: Algorithm 1 int recurseFunc(int n) If n 0, return 1. If n 1, return 1 while i< n do while j <n do print("hi") j 1 end while i i 1 end while int a recurse Func(n/9); int b recurse Func (n/9) int c recurse Func (n/9) return a b c (1) Set up a runtime recurrence for the runtime T n) of this algorithm. (2) Solve...
(V). Given the following algorithm, answer relevant questions. Algorithm 1 An algorithm 1: procedure WHATISTHIS(21,22,...,n: a...
(V). Given the following algorithm, answer relevant questions. Algorithm 1 An algorithm 1: procedure WHATISTHIS(21,22,...,n: a list of n integers) for i = 2 to n do c= j=i-1 while (j > 0) do if ra; then break end if 4j+1 = a; j= j-1 end while j+1 = 1 end for 14: return 0.02. 1, 15: end procedure Answer the following questions: (1) Run the algorithm with input (41, 02, 03, 04) = (3, 0, 1,6). Record the values...
Determine the basic operation(s) in the following algorithm and then analyze its performance for i =...
Determine the basic operation(s) in the following algorithm and then analyze its performance for i = 1 to n do { } for j = i to n do x++; for j = 1 to i do y++;
Explain why the following algorithm is complete, correct, and finite. Input: a list of n distinct...
Explain why the following algorithm is complete, correct, and finite. Input: a list of n distinct integers a0 to an-1 ordered from least to greatest and an integer x Output: the index in the list at which x is found, or -1 if x is not found Procedure: i = 0 while (i <= n-1 and x != ai) i = i + 1 if i < n then location = i else location = -1 return location
6. Consider the following algorithm, where P is an array containing random numbers. The function swap(v1,v2)...
6. Consider the following algorithm, where P is an array containing random numbers. The function swap(v1,v2) will swap the values stored in the variables v1 and v2. Note that % is the modulus operation, and will return the integer remainder r of a/b, i.e., r-a%b Require: Array P with n > 0 values 1: i-1, j-n-l 2: while i<=j do for a=i to j by i do 4: 5: 6: 7: if Pla>Pat 11 and Pla]%2--0 then swap(Plal, Pla+1l) end...
I do not understand what theta m is in part a? Please complete problem and explain...
I do not understand what theta m is in part a? Please complete
problem and explain what theta m is. Thank you!
1) (25 points) A 1-kg collar is attached to a spring and slides without friction along a circular rod which lies in a vertical plane. The spring has a constant k-0.60 kN/m and is undeformed when the collar is at point B. The collar is release from rest at point C. Calculate 0m, where θm is the maximum...
[Recursive Cost] [ALGORITHM] Improving Efficiency PLEASE explain in DETAIL the following question in detail. The algorithm...
[Recursive Cost] [ALGORITHM] Improving
Efficiency
PLEASE explain in DETAIL the following question in detail. The
algorithm is also given below. Thank You!
1.a) Define recursively the worst case cost Kn of the Knapsack
function for n items. Remember that you need to provide both the
base case and the recurrence relation. Also do not forget to
include the cost of the function Worth in your cost. Justify your
answer (i.e. explain what each component of the formula
represents). [5points]
1.b) Use...
Explain the code and analyze the performance of algorithm #include<stdio.h> #include<string.h> #define NUM 1...
Explain the code and analyze the performance of algorithm #include<stdio.h> #include<string.h> #define NUM 100 #define maxint 10000 void dijkstra(int n,int v,int dist[],int prev[],int c[][NUM]) { int i,j; bool s[NUM]; for(i=1; i<=n; i++) { dist[i] = c[v][i]; s[i] = false; if (dist[i]>maxint) prev[i] = 0; else prev[i] = v; } dist[v] = 0; s[v] = true; for(i=1; i<n; i++) { int tmp = maxint; int u = v; for(j=1; j<=n; j++) if(!(s[j]) && (dist[j]<tmp)) { u = j; tmp = dist[j]; ...
The following algorithm (Rosen pg. 363) is a recursive version of linear search, which has access to a global list of distinct integers a_1, a_2,..., a_n. procedure search(i, j, x : i,j, x integers, 1 < i < j < n) if a_i = x then return i else if i = j then 4. return 0 else return search(i + 1, j, x) Prove that this algorithm correctly solves the searching problem when called with parameters i = 1...
Discrete Math
Give a big-Theta estimate for the number of additions in the following algorithm a) procedure f (n: integer) bar = 0; for i = 1 to n^3 for j = 1 to n^2 bar = bar + i + j return bar b) Consider the procedure T given below. procedure T (n: positive integer) if n = 1 return 2 for i = 1 to n^3 x = x + x + x return T(/4) + T(/4) +...
3. Recursive Program (6 points) Consider the following recursive function for n 1: Algorithm 1 int recurseFunc(int n) If n 0, return 1. If n 1, return 1 while i< n do while j <n do print("hi") j 1 end while i i 1 end while int a recurse Func(n/9); int b recurse Func (n/9) int c recurse Func (n/9) return a b c (1) Set up a runtime recurrence for the runtime T n) of this algorithm. (2) Solve...
(V). Given the following algorithm, answer relevant questions. Algorithm 1 An algorithm 1: procedure WHATISTHIS(21,22,...,n: a list of n integers) for i = 2 to n do c= j=i-1 while (j > 0) do if ra; then break end if 4j+1 = a; j= j-1 end while j+1 = 1 end for 14: return 0.02. 1, 15: end procedure Answer the following questions: (1) Run the algorithm with input (41, 02, 03, 04) = (3, 0, 1,6). Record the values...
6. Consider the following algorithm, where P is an array containing random numbers. The function swap(v1,v2) will swap the values stored in the variables v1 and v2. Note that % is the modulus operation, and will return the integer remainder r of a/b, i.e., r-a%b Require: Array P with n > 0 values 1: i-1, j-n-l 2: while i<=j do for a=i to j by i do 4: 5: 6: 7: if Pla>Pat 11 and Pla]%2--0 then swap(Plal, Pla+1l) end...
I do not understand what theta m is in part a? Please complete
problem and explain what theta m is. Thank you!
1) (25 points) A 1-kg collar is attached to a spring and slides without friction along a circular rod which lies in a vertical plane. The spring has a constant k-0.60 kN/m and is undeformed when the collar is at point B. The collar is release from rest at point C. Calculate 0m, where θm is the maximum...
[Recursive Cost] [ALGORITHM] Improving
Efficiency
PLEASE explain in DETAIL the following question in detail. The
algorithm is also given below. Thank You!
1.a) Define recursively the worst case cost Kn of the Knapsack
function for n items. Remember that you need to provide both the
base case and the recurrence relation. Also do not forget to
include the cost of the function Worth in your cost. Justify your
answer (i.e. explain what each component of the formula
represents). [5points]
1.b) Use...
Most questions answered within 3 hours.
-
A man stands on the roof of a building of height 13.0 mm and
throws a...
asked 1 minute from now -
Based on the range, which of the following sets of scores has
the greatest variability? 3,...
asked 2 minutes ago -
The extent to which assets are financed by borrowed funds and
other liabilities is indicated by:...
asked 1 hour ago -
Explain in detail
Germany is the fifth largest economy
explain what goods and services Germany specializes...
asked 1 hour ago -
The density of platinum is 21.45 g/mL. If a cube of platinum
with a mass of...
asked 1 hour ago -
Accounts Receivable
Sales
A/R Posting
Extended Sales Invoice
Packing Slip
Compare invoice to packing slip 2...
asked 1 hour ago -
Michaella, age 23, is a full-time law student and is claimed by
her parents as a...
asked 1 hour ago -
Why are polymers not typically casted into products?
asked 1 hour ago -
When rolling a die 129 times, what is the probability of rolling
a 6 no more...
asked 1 hour ago -
4. A call option currently sells for $7.75. It has a strike
price of $85 and...
asked 1 hour ago -
1.
You need to prepare 10.0 liters of an acid aqueous solution with a
pH of...
asked 1 hour ago -
Along an aggregate supply curve, if the level of output is less
than the natural level...
asked 1 hour ago