Answer:
4
Step-by-step explanation:
Answer:
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 ![[6,9,8,7]](https://tex.z-dn.net/?f=%5B6%2C9%2C8%2C7%5D)
Step-by-step explanation:
hypotenuse =

Adding them up, we have 1/2+3/20+2/5+4/5. We can do a bit of guess and checking to see that 2, 5, and 20 go into 20. 20/2=10 and 20/5=4, so we multiply 1/2 by 10/10 and 2/5 and 4/5 by 4/4 to get 10/20+3/20+8/20+16/20= 37/20
Answer:172
Step-by-step explanation:
24.5 times 6 is 157
Plus 15 for the paint is 172 for the TOTAL for ALL she spent