Re: Help: my list adt is broken

[Chad R. Meiners <chadmeiners@my-deja.com>]

I assume this for a class since writing this ADT is a very common
assignment
for a second semester university course.  I'll give you some advice on
debugging.

First, you don't provide enough of the information in your test
output.  You
need to look at all of the information in the data structure.  You
should
print out the Head element, tail element and the size each time you
change
the list data type.  Second, you should print out the value of the
neighboring nodes or at least whether or not the pointers are null.

Another method (if you don't want to write the code to display the above
information) would be to desk check your code.  Draw a representation of
your list and draw the list's representation during each change done by
the
remove procedure.

Using either method should reveal to you that the first call to the
remove
procedure leaves the ADT in an incorrect state.

>i think i've been staring at it too long!!!  i'll let someone else
>takeover.

You should not give up so easily.  If you follow the above methods I am
sure
you should be able to fix your ADT by yourself.  Writing correct code
requires a good deal of effort and deligence.  Gathering all of the
data and
having a clear understanding of the problem are the most effective
methods
of preventing yourself from staring at the code until you give up ;)

Good Luck,
Chad R. Meiners



Sent via Deja.com
http://www.deja.com/