Merge Sort as Divide and Conquer in DSA Java - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to split the array into two halves.

DSA Java

int mid = arr.length [1] 2;

Drag options to blanks, or click blank then click option'

A+

B*

C-

D/

Attempts:

3 left

💡 Hint

Common Mistakes

Using '+' instead of '/' causes incorrect middle index.

Using '*' or '-' will not split the array correctly.

We divide the length by 2 to find the middle index for splitting the array.

2fill in blank

medium

Complete the code to copy the left half of the array.

DSA Java

int[] left = Arrays.copyOfRange(arr, 0, [1]);

Drag options to blanks, or click blank then click option'

Amid

Barr.length

Carr.length / 2 + 1

D0

Attempts:

3 left

💡 Hint

Common Mistakes

Using arr.length copies the whole array, not just the left half.

Using 0 as end index results in an empty array.

We copy from index 0 to mid to get the left half of the array.

3fill in blank

hard

Fix the error in the merge function call to correctly merge two sorted halves.

DSA Java

merge(arr, left, right, [1]);

Drag options to blanks, or click blank then click option'

Aarr.length

Bleft.length

Cright.length

D0

Attempts:

3 left

💡 Hint

Common Mistakes

Passing left.length or right.length causes incomplete merging.

Passing 0 causes no merging to happen.

The merge function needs the total length of the array to merge all elements.

4fill in blank

hard

Fill both blanks to complete the recursive calls for merge sort.

DSA Java

mergeSort([1]);
mergeSort([2]);

Drag options to blanks, or click blank then click option'

Aleft

Bright

Carr

Dmid

Attempts:

3 left

💡 Hint

Common Mistakes

Calling mergeSort on arr twice causes infinite recursion.

Using mid as argument is incorrect since it's an index, not an array.

We recursively sort the left and right halves separately.

5fill in blank

hard

Fill all three blanks to complete the merge function's main loop conditions.

DSA Java

while (i < [1] && j < [2]) {
    if (left[i] <= right[j]) {
        arr[k++] = left[i++];
    } else {
        arr[k++] = right[j++];
    }
}
while (i < [3]) {
    arr[k++] = left[i++];
}

Drag options to blanks, or click blank then click option'

Aleft.length

Bright.length

Carr.length

Dk

Attempts:

3 left

💡 Hint

Common Mistakes

Using arr.length in the first while causes index errors.

Using k as a bound is incorrect since k is the merged array index.

We compare elements while i and j are within left and right lengths, then copy remaining left elements.

Practice

1. What is the main idea behind the Merge Sort algorithm in the context of divide and conquer?

easy

A. Select a pivot and partition the array around it

B. Sort the array by repeatedly swapping adjacent elements

C. Divide the array into halves, sort each half, then merge them

D. Build a heap and extract elements in sorted order

Solution

1. Step 1: Understand divide and conquer in Merge Sort

   Merge Sort splits the array into two halves recursively until single elements remain.

2. Step 2: Merge sorted halves

   It then merges these sorted halves back together to form a sorted array.

3. Final Answer:

   Divide the array into halves, sort each half, then merge them -> Option C

4. Quick Check:

   Divide and conquer = split, sort, merge [OK]

Hint: Remember: split, sort halves, then merge [OK]

Common Mistakes:

• Confusing Merge Sort with Bubble Sort
• Thinking Merge Sort uses pivot like Quick Sort
• Ignoring the merge step after dividing

2. Which of the following is the correct way to declare the merge function header in Java for merging two sorted subarrays in Merge Sort?

easy

A. int merge(int arr[], int start, int end)

B. void merge(int[] arr, int left, int mid, int right)

C. void merge(int arr[], int low, int high)

D. int merge(int[] arr, int left, int right)

Solution

1. Step 1: Identify parameters needed for merging

   The merge function needs the array and indices: left, mid, right to merge two halves.

2. Step 2: Check method signature correctness

   It returns void and takes int[] arr, int left, int mid, int right as parameters.

3. Final Answer:

   void merge(int[] arr, int left, int mid, int right) -> Option B

4. Quick Check:

   Correct merge signature = void merge(arr, left, mid, right) [OK]

Hint: Merge needs array and three indices: left, mid, right [OK]

Common Mistakes:

• Using wrong parameter names or missing mid index
• Returning int instead of void
• Confusing start/end with left/right without mid

3. What will be the output of the following Java code snippet using Merge Sort on the array [4, 1, 3, 9, 7]?

int[] arr = {4, 1, 3, 9, 7};
mergeSort(arr, 0, arr.length - 1);
System.out.println(Arrays.toString(arr));

medium

A. [1, 4, 3, 7, 9]

B. [4, 1, 3, 7, 9]

C. [9, 7, 4, 3, 1]

D. [1, 3, 4, 7, 9]

Solution

1. Step 1: Apply Merge Sort to the array

   Merge Sort divides and merges to sort: [4,1,3,9,7] -> [1,3,4,7,9]

2. Step 2: Verify final sorted array

   The sorted array is ascending: [1, 3, 4, 7, 9]

3. Final Answer:

   [1, 3, 4, 7, 9] -> Option D

4. Quick Check:

   Sorted array = ascending order [OK]

Hint: Merge Sort always outputs sorted ascending array [OK]

Common Mistakes:

• Confusing merge step output with partial arrays
• Assuming original order remains
• Mixing up ascending and descending order

4. Identify the error in this Merge Sort merge function snippet:

void merge(int[] arr, int left, int mid, int right) {
  int n1 = mid - left;
  int n2 = right - mid;
  int[] L = new int[n1];
  int[] R = new int[n2];
  for (int i = 0; i < n1; i++) L[i] = arr[left + i];
  for (int j = 0; j < n2; j++) R[j] = arr[mid + 1 + j];
  // merging logic follows...
}

medium

A. Incorrect calculation of n1 size

B. Wrong copying of elements into R array

C. Missing return statement in void method

D. Using < instead of <= in for loops

Solution

1. Step 1: Check size calculations for subarrays

   n1 should be mid - left + 1 and n2 should be right - mid to cover all elements.

2. Step 2: Identify impact of wrong sizes

   Incorrect sizes cause array index errors or missing elements during merge.

3. Final Answer:

   Incorrect calculation of n1 size -> Option A

4. Quick Check:

   Sizes must include mid element [OK]

Hint: Remember: n1 = mid-left+1, n2 = right-mid [OK]

Common Mistakes:

• Forgetting +1 in n1 size calculation
• Copying elements starting at wrong index
• Confusing loop bounds with <= instead of <

5. Given an array with many duplicate values, how should the merge step in Merge Sort be adapted to maintain stability (preserve original order of equal elements)?

hard

A. When elements are equal, copy from the left subarray first

B. When elements are equal, copy from the right subarray first

C. Skip duplicates during merge to reduce array size

D. Sort duplicates separately after merge

Solution

1. Step 1: Understand stability in sorting

   Stable sort keeps equal elements in original order.

2. Step 2: Apply stability rule in merge step

   When equal, copy element from left subarray first to preserve order.

3. Final Answer:

   When elements are equal, copy from the left subarray first -> Option A

4. Quick Check:

   Left first on equals = stable merge [OK]

Hint: Copy left element first on equal values to keep stability [OK]

Common Mistakes:

• Copying right element first breaks stability
• Removing duplicates during merge
• Sorting duplicates separately after merge