Question

Strange programming problems as of now..As you can see below i have assigned intFrontPtr to point to the first cell in the array. And intBackPtr to point to the last cell in the array…:

bool quack::popFront( int &popFront )
{   
    //items[count-1].n = { 9,4,3,2,1,0 };
    nPopFront = items[0].n;
    if ( count >= maxSize ) return false;
    else
    {
        items[0].n  = nPopFront;
        intFrontPtr = &items[0].n;
        intBackPtr  = &items[count-1].n;
    }
    for (int temp; intFrontPtr < intBackPtr ;)
    {
          intFrontPtr++;
          temp = *intFrontPtr;
         *intFrontPtr = temp;
    }
    --count;
    return true;
}

Its just my implementation of a cross between a queue and a stack..PopFront is a public method of the class object quack..The items is a private struct type ‘item’, it is within the quack.h. It has one member, ‘int n’..But, that is irrelevent.

the comment in the code is the contents of my integer array, ‘items’.

I am trying to Pop elements off the front of my array. WHat im thinking is that after i get the first item, i’ll just incrememnt the frontPtr and transfer the item i got previously to the frontPtr i incremented!…

I cannot, for any reason, use a + or – shift by 1 or the use of stls, boosts, std’s and the like..

Can someone help me with my homework assignment?

Answer 1

My suggestion are :

1). Put statement –count where it keeps object’s state valid on exceptional condition.

2). clear your concepts of pointers which will help you a lot.