TryBugHunt
cppLogic errorMedium

AI Attempt: Merging two sorted lists comes out unsorted

๐Ÿค– AI Code ReviewSpot the flaw in the AI assistant's solution

An AI assistant wrote this implementation with complete confidence. It passes standard inputs, but fails on a subtle edge case โ€” the exact skill tested in modern AI-assisted interview rounds. Audit the logic, isolate what the model missed, and make it production-ready.

What it should do

An AI assistant wrote the merge step of merge sort. mergeSorted(a, b) combines two lists sorted from low to high into one sorted list. Example: mergeSorted({1, 4, 6}, {2, 3, 7}) โ†’ {1, 2, 3, 4, 6, 7}

What happens instead

mergeSorted({1, 4, 6}, {2, 3, 7}) returns [2, 3, 7, 1, 4, 6].

#include <vector>

std::vector<int> mergeSorted(std::vector<int> a, std::vector<int> b) {
    std::vector<int> out;
    size_t i = 0, j = 0;
    while (i < a.size() && j < b.size()) {
        if (a[i] > b[j]) out.push_back(a[i++]);
        else out.push_back(b[j++]);
    }
    while (i < a.size()) out.push_back(a[i++]);
    while (j < b.size()) out.push_back(b[j++]);
    return out;
}

Test a custom input to verify an edge case (e.g. empty lists, negative numbers, duplicates).

โฑ๏ธ0:00
Hints
๐Ÿ† 0 hints = Flawless Solve
Think & Test Cooldown
2:00 remaining

Take a moment to read the bug symptom and trace the code with Run & Check before unlocking Hint 1.

Hint 2
Unlocks after Hint 1
Hint 3
Unlocks after Hint 2

This bug belongs to the logic errors pattern

The wrong operator, an inverted condition, a formula the right way round but backwards.

What you'll practise

A medium C++ debugging exercise about logic errors: the wrong operator, an inverted condition, a formula the right way round but backwards.

The checks your fix must pass

Signs of this kind of bug

Spoiler: why this bug happens(try it first; the hints get warmer one at a time)

What went wrong: Each step should take the smaller of the two front values. The comparison a[i] > b[j] takes from a only when a's value is bigger, which is the opposite, so values come out in the wrong order.

The fix: Take from a when a[i] < b[j], otherwise from b.

Remember: In a merge, the output is built from the smallest remaining value each time. If the result looks like the two inputs glued together, check which side wins the comparison.

The pattern behind it: logic errors.

More logic errors to practise

Embed this challenge on your site

Paste this into any web page or blog post. Visitors fix the bug right there, in their browser.

<iframe src="https://trybughunt.com/embed/46f3bce2-7f9f-407a-86e3-26571d62d1e1" title="Debugging challenge: AI Attempt: Merging two sorted lists comes out unsorted" width="100%" height="580" loading="lazy" style="border:1px solid #d4d4d8;border-radius:12px;max-width:760px"></iframe>
<p style="font-size:14px">Debugging challenge from <a href="https://trybughunt.com/challenges/46f3bce2-7f9f-407a-86e3-26571d62d1e1">TryBugHunt</a></p>