When insertion goes wrong..

InsertionSort.cpp

void insertion_sort(int list[], int length)
{
    int j = 1;
    int key = list[j];
    std::cout << key << std::endl;

    while(j < length)
    {
        int i = j - 1;

        while(i >=0 && list[i] > key)
        {
            list[i + 1 ] = list[i];
            --i;
        }

        list[i + 1] = key;
        j++;
        
        // Priting infomation for debugging
        for(int i = 0; i < 10; i++)
        {
            std::cout << list[i] << ", ";
        }
        std::cout << std::endl;
    }

    for(int i = 0; i < 10; i++)
    {
        std::cout << list[i] << ", ";
    }
}