Merge sort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step?

(A) Elements in the first half of the array are less than or equal to elements in the second half of the array
(B) The array elements form a heap
(C) Elements in the second half of the array are less than or equal to elements in the first half of the array
(D) None of the above

Related Posts 👇

  • Which of the following statement is correct?

    (A) A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor
    (B) A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor
    (C) A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor
    (D) A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor

Leave a Reply

Your email address will not be published. Required fields are marked *