Answer:
9.09 , 0.9 , 0.09 , 0.009 , 0.0009
Explanation:
The more places behind a decimal point a number is, the smaller it is
Hope this helped you! :)
Answer:
Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)
Step-by-step explanation:
To understand better how we arrived at the aforementioned algorithm, we take it step by step
a, Construct a min-heap of the minimum elements from each of "k" lists.
The creation of this min-heap will cost O (k) time.
b) Next we run delete Minimum and move the minimum element to the output array.
Each extraction takes O (log k) time.
c) Then insert into the heap the next element from the list from which the element was extracted.
Now, we note that since we extract n elements in total, the running time is
O (n log k+ k) = O (n log k).
So we can conclude that :
Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)
He’s right For the answer
Answer:
Part one: The function rule for the area of the rectangle is A(x) = 3x² - 2x
Part two: The area of the rectangle is 8 feet² when its width is 2 feet
Step-by-step explanation:
Assume that the width of the rectangle is x
∵ The width of the rectangle = x feet
∵ The length of the rectangle is 2 ft less than three times its width
→ That means multiply the width by 3, then subtract 2 from the product
∴ The length of the rectangle = 3(x) - 2
∴ The length of the rectangle = (3x - 2) feet
∵ The area of the rectangle = length × width
∴ A(x) = (3x - 2) × x
→ Multiply each term in the bracket by x
∵ A(x) = x(3x) - x(2)
∴ A(x) = 3x² - 2x
∴ The function rule for the area of the rectangle is A(x) = 3x² - 2x
∵ The rectangle has a width of 2 ft
∵ The width = x
∴ x = 2
→ Substitute x by 2 in A(x)
∵ A(2) = 3(2)² - 2(2)
∴ A(2) = 3(4) - 4
∴ A(2) = 12 - 4
∴ A(2) = 8
∴ The area of the rectangle is 8 feet² when its width is 2 feet
