GATE CS 2026 (Afternoon) — Question 32

AlgorithmsDivide-and-Conquer DesignsNAT1 markHard

Consider an array \( A = [10, 7, 8, 19, 41, 35, 25, 31] \). Suppose the merge sort algorithm is executed on array \( A \) to sort it in increasing order. The merge sort algorithm will carry out a total of 7 merge operations. A merge operation on sorted left array \( L \) and sorted right array \( R \) is said to be void if the output of the merge operation is the elements of array \( L \) followed by the elements of array \( R \). The number of void merge operations among these 7 merge operations is ________. (answer in integer)
Practise the full 2026-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Divide-and-Conquer DesignsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group