Too many passes in bubble sort?

My bubble sorter does one too many passes according to the problem answers, but does the correct number of swaps. I can't seem to figure out why, and I'm pretty much banging my head against a brick wall at this point. Any help?

/* Bubble sort algorithm. */

#include <iostream>
using namespace std;

int main(int argc, char** argv) 
{
    cout << "Enter data: ";
    int length;
    cin >> length;
    int holder[length];
    for (int i = 0; i < length; i++)
    {
        cin >> holder[i];
    }

    int passes = 0;
    int swaps = 0;

    for (int j = 0; j < length - 1; j++)
    {
        bool swapped = false;

        for (int k = 1 + j; k < length; k++)
        {
            if (holder[j] > holder[k])
            {
                int temp = holder[j];
                holder[j] = holder[k];
                holder[k] = temp;
                swaps++;
                swapped = true;
            }

        }
        if (!swapped)
        {
            break;
        }
        else if (j != length - 2)
        {
            passes++;
        }
    }

    cout << endl;

    for (int ii = 0; ii < length; ii++)
    {
        cout << " " << holder[ii];
    }


    cout << endl << " " << passes << " " << swaps;
    return 0;
}

I don't think it does either now that you mention it. I'm gonna go back and rewrite it, and see if I can come up with the correct solution. Thanks for the input!