GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2026 · CS2 - Afternoon
AlgorithmsSortingmediumNAT1 mark
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)
Save your progress

Related Algorithms PYQs

GATE 2026 · CS1 - Forenoon

Consider the following recurrence relations: for all n > 1, T1(n) = 4*T1(n/2) + T2(n), and T2(n) = 5*T2(n/4) + \(\Theta(\log_2 n)\…

GATE 2026 · CS1 - Forenoon

Let G(V,E) be an undirected, edge-weighted graph with integer weights. The weight of a path is the sum of the weights of the edges…

GATE 2026 · CS1 - Forenoon

Let G(V,E) be a simple, undirected graph. A vertex cover of G is a subset V' subset of V such that for every (u,v) in E, u in V' o…

GATE 2026 · CS1 - Forenoon

Let G(V,E) be a simple, undirected, edge-weighted graph with unique edge weights. Which of the following statements about the mini…

GATE 2026 · CS1 - Forenoon

Consider the following pseudocode for depth-first search (DFS) algorithm which takes a directed graph G(V,E) as input, where d[v] …

GATE 2026 · CS1 - Forenoon

An undirected, unweighted, simple graph G(V,E) is said to be 2-colorable if there exists a function c: V → {0,1} such that for eve…