Consider a min heap, represented by the following array:
3,4,6,7,5,10
After inserting a node with value 1.Which of the following is the updated min heap?
Consider te following array
23 15 5 12 40 10 7
After the first pass of a particular algorithm, the array looks like
15 5 12 23 10 7 40
Name the algorithm used
Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. How many items are
now guaranteed to be in their final spot (never to be moved again)?