Here is an array of ten integers 6 4 0 3 9 8 1 7 2 5
1 answer:
Answer:
and
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
elements in second array will be
Hence the resulting array after the partition finishes are and
You might be interested in
Answer:
On a coordinate plane, a trapezoid has points (0, 0), (0.5, 2), (1, 2), (1.5, 0).
Step-by-step explanation:
If a trapezoid is dilated with a scale factor between 0 and 1, the resulting trapezoid will look smaller than the original trapezoid.
Since the figure is missing, we can examine the coordinates.
By analyzing the coordinates critically, the correct choice is :
On a coordinate plane, a trapezoid has points (0, 0), (0.5, 2), (1, 2), (1.5, 0).
Because when we compare to the original figure with coordinates:
(0, 0), (1, 4), (2, 4), (3, 0), we can see that, the coordinates of the original figure were multiplied by .
The scale factor is and this is between 0 and 1