Check the answer that best describes the relationship between f(x) and x. (For example if f(x) is Θ(x) check that as your answer
1 answer:
You might be interested in
Answer:
Condition to break:
Efficiency: O(n).
Explanation:
Previous concepts
Heap algorithm is used to create all the possible permutations with K possible objects. Was created by B. R Heap in 1963.
Parental dominance condition represent a condition that is satisfied when the parent element is greater than his children.
Solution to the problem
We assume that we have an array H of size n for the algorithm.
It's important on this case analyze the parental dominance condition in order to the algorithm can work and construc a heap.
For this case we can set a counter j =1,2,... [n/2] (We just check until n/2 since in order to create a heap we need to satisfy minimum n/2 possible comparisions
And we just need to check on the array the last condition and if is not satisfied for any value of the counter j we need to stop the algorithm and the array would not a heap. Otherwise if we satisfy the condition for each then we will have a heap.
On this case this algorithm needs to compare 2*(n/2) times the values and the efficiency is given by O(n).
Answer:
a)
b)Mass in lb = 376.8 lb
Mass in slug = 11.71 slug
c)
d)
Explanation:
Given that
d= 2 ft
r= 1 ft
h= 3 ft
Density
a)
We know that volume V given as
b)
Mass = Density x volume
mass= 376.8 lb
We know that
1 lb = 0.031 slug
So 376.8 lb= 11.71 slug
Mass in lb = 376.8 lb
Mass in slug = 11.71 slug
c)
we know that specific volume(v) is the inverse of density.
d)
Specific weight(w) is the product of density and the gravity(g).
w= ρ X g
w = 40 x 31.9