Answer:
1 7/8 quarts
Step-by-step explanation:
The amount Yuan has left can be found by multiplying the original amount by the fraction he has left.
__
<h3>used</h3>
After using 1/2 of the broth for soup, the fraction remaining is ...
1 -1/2 = 1/2
The amount Yuan used for gravy is 1/4 of this, or ...
(1/4)(1/2) = 1/8 . . . of the original amount of broth
The total fraction Yuan used was ...
fraction used = fraction for soup + fraction for broth = 1/2 +1/8 = 5/8
<h3>remaining</h3>
Then the fraction remaining is ...
fraction remaining = 1 - fraction used = 1 - 5/8 = 3/8.
The amount remaining is this fraction of the original amount:
(3/8)(5 quarts) = 15/8 quarts = 1 7/8 quarts . . . . remaining
Ascending order just means to be arranged from smallest to largest
Answer: 1/6 2/3 3/5
Area = PI x r^2
area = 3.14 x 6^2
area = 3.14 x 36
area = 113.04 square yards
round the answer if needed.
Answer:
26°
Step-by-step explanation:
90°+64°+x°=180° (Sum of all the angles in a right angled triangle=180°)
154°+x°=180°
x°=180-154°
x°=26°
Answer:
![[4,0,3,1,2,5]](https://tex.z-dn.net/?f=%5B4%2C0%2C3%2C1%2C2%2C5%5D)
and ![[6,9,8,7]](https://tex.z-dn.net/?f=%5B6%2C9%2C8%2C7%5D)
Step-by-step explanation:
GIVEN: an array of ten integers 
.
TO FIND: If we partition this array using Quick sort's partition function and using 
for the pivot. List the elements of the resulting array after the partition finishes.
SOLUTION:
quick sort is a divide and conquer algorithm in which an array is partitioned into sub-arrays about an pivot element by checking whether elements are greater than pivot or and then sub arrays are sorted recursively.
Here is the pivot element.
two arrays will be created, in first array element less than or equal to pivot element are stored in other elements greater than pivot element are stored.
Starting from first element of array
elements in first array will be ![=[4,0,3,1,2,5]](https://tex.z-dn.net/?f=%3D%5B4%2C0%2C3%2C1%2C2%2C5%5D)
elements in second array will be ![=[6,9,8,7]](https://tex.z-dn.net/?f=%3D%5B6%2C9%2C8%2C7%5D)
Hence the resulting array after the partition finishes are and
