Logical Errors and Infinite Loops

The most common and frustrating mistakes in Bubble Sort are logical errors, especially "off-by-one" errors in the loop conditions. These bugs won't crash your C program, but they will give you the wrong answer or, worse, try to access memory that isn't yours.

• Error 1: Inner Loop Boundary is Wrong
  • The Bug: Writing the inner loop as for (j = 0; j < n; j++).
  • The Problem: Inside this loop, you compare arr[j] with arr[j+1]. When j reaches the last element (n-1), the code will try to access arr[n], which is out of the array's bounds. This can lead to a "Segmentation fault" or just reading garbage data.
  • The Fix: The loop must stop one element early. The condition should be j < n - 1 (or j < n - i - 1 for the optimized version).
• Error 2: Misplacing the Optimization Flag
  • The Bug: Putting swapped = false; inside the inner loop.
  • The Problem: If you do this, the flag will be reset on every single comparison. Even if a swap happens, the flag might be set back to false on the very next comparison if those elements are already in order. The algorithm might then break early, leaving the array unsorted.
  • The Fix: The swapped = false; line must only go before the inner loop starts, (i.e., inside the outer loop).

Luckily, Bubble Sort's structure is simple, so it's not prone to infinite loops unless you make a fundamental error in your for loop syntax (like for(i=0; i > -5; i++), which would never end). The common bugs are almost always in the loop conditions.

1.Misplaced Comparison Operators

This is the simplest bug with the most obvious symptom: your array gets sorted, but in the wrong direction!

The entire logic of the sort is controlled by this single line:

• Ascending Order (Smallest to Largest): The > (greater than) operator checks: "Is the left element bigger than the right element?" If YES, it swaps them. This correctly "bubbles" the largest values to the end.
• The Mistake (Descending Order): If you accidentally write:

• The Problem: The code now checks: "Is the left element smaller than the right element?" If YES, it swaps. This will "bubble" the smallest values to the end, resulting in a descending sort (e.g., [8, 5, 4, 2, 1]).

Debugging Tip: If you run your program and the output is [8, 5, 4, 2, 1] instead of [1, 2, 4, 5, 8], the very first place you should look is your if statement. You almost certainly have a < where you meant to have a >. This isn't technically a "bug" if you wanted a descending sort, but it's the most common logical error when trying to sort from smallest to largest.