To order the records in the answer to a query in a particular way, you "Sort" the records. Sorting the records will allow the user to sort the sequence of the records based on his or her preferences, he or she may sort it ascending or descending.<span />
Answer:
C
Explanation:
I believe that's the answer if it's not sorry
<span>C. when listing items that have an order of priority
</span>
Answer:
Explanation:
We start from the bottom-most and rightmost internal node of min Heap and then heapify all internal modes in the bottom-up way to build the Max heap.
To build a heap, the following algorithm is implemented for any input array.
BUILD-HEAP(A)
heapsize := size(A)
for i := floor(heapsize/2) downto 1
do HEAPIFY(A, i)
end for
Convert the given array of elements into an almost complete binary tree.
Ensure that the tree is a max heap.
Check that every non-leaf node contains a greater or equal value element than its child nodes.
If there exists any node that does not satisfy the ordering property of max heap, swap the elements.
Start checking from a non-leaf node with the highest index (bottom to top and right to left).
Answer:
1.enhace the speed and accuracy of work
2.Large historical data can be stored easily for future use.
3.Quick calculation and display of graphical and mathematical data.
