Computer Science A - 9/16/99

Continued from 9/15/99

{
    int lcv = 0, index;
    while(lcv < Numbers.length())
    {
        if(Numbers[lcv] == item)
        {
            for(index = lcv; index < Numbers.length() - 1; index++)
                Numbers[index] = Numbers[index + 1];
            Numbers.length() = Numbers.length() - 1;
        }
        else
            lcv++;
    }
}

Other solution

{
    int ctr = 0;

    for(int lcv = 0; lcv < Numbers.length(); lcv++)
    {
        if(Numbers[lcv] != item)
        {
            Numbers[ctr] = Numbers[lcv];
            ctr++;
        }
        Numbers.length() = ctr;
    }
}