Merge Two Sorted Arrays Without Extra Space in DSA C - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to swap two integers using pointers.

DSA C

void swap(int *a, int *b) {
    int temp = *a;
    *a = [1];
    *b = temp;
}

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

Aa

B*a

Ctemp

D*b

Attempts:

3 left

💡 Hint

Common Mistakes

Using variable names instead of dereferencing pointers.

To swap values, assign the value pointed by b to the location pointed by a.

2fill in blank

medium

Complete the condition to check if the first array element is greater than the second array element.

DSA C

if (arr1[i] [1] arr2[j]) {
    // swap logic
}

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

A>

B<

C==

D<=

Attempts:

3 left

💡 Hint

Common Mistakes

Using less than instead of greater than.

We swap when the element in arr1 is greater than the element in arr2.

3fill in blank

hard

Fix the error in the loop condition to iterate over the first array.

DSA C

for (int i = 0; i [1] n; i++) {
    // processing
}

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

A>

B<

C>=

D<=

Attempts:

3 left

💡 Hint

Common Mistakes

Using > or >= causes no iterations or errors.

The loop should run while i is less than n to cover all elements from 0 to n-1.

4fill in blank

hard

Fill both blanks to complete the nested loops for merging arrays.

DSA C

for (int i = 0; i [1] n; i++) {
    for (int j = 0; j [2] m; j++) {
        if (arr1[i] > arr2[j]) {
            swap(&arr1[i], &arr2[j]);
        }
    }
}

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

A<

B>

C<=

D>=

Attempts:

3 left

💡 Hint

Common Mistakes

Using <= causes index out of range errors.

Both loops should run from 0 to less than their respective sizes to cover all elements.

5fill in blank

hard

Fill all three blanks to complete the function that merges two sorted arrays without extra space.

DSA C

void merge(int arr1[], int arr2[], int n, int m) {
    for (int i = 0; i [1] n; i++) {
        if (arr1[i] > arr2[0]) {
            [2](&arr1[i], &arr2[0]);
            int first = arr2[0];
            int k;
            for (k = 1; k [3] m && arr2[k] < first; k++) {
                arr2[k - 1] = arr2[k];
            }
            arr2[k - 1] = first;
        }
    }
}

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

A<

Bswap

C<=

D>

Attempts:

3 left

💡 Hint

Common Mistakes

Using > instead of < in loops.

Forgetting to swap elements.

The outer loop runs while i < n. We swap arr1[i] and arr2[0] if needed. The inner loop shifts elements in arr2 while k < m and arr2[k] < first.