

you can check in your calculator.
anyhow, to get the "recurring decimal to fraction", you start by setting to some variable, "x" in this case, then move the repeating part to the left of the point by multiplying it by some power of 10, and then do the equating.
Answer:
one real solution
Step-by-step explanation:
square root of 0 is 0
9514 1404 393
Answer:
160
Step-by-step explanation:
The problem statement tells us ...
(# in museum) = 4 × (# waiting)
(# in museum) = 4 × 40 . . . . . . . . . . . . the number waiting is 40
# in museum = 160
So, what I did was multiply 33*6 and got 198 and then 228-198 to find out that the initial fee was 30 dollars. then multiply 33*9+30 to get a 9 month total cost of $327. Hope from here you are able to set up your equation now you have all the information needed :)
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)