Hi, currently I'm in a Data Structures and Algorithm class, and I have a question about linked lists. I've read the chapter once and I am about to read it again but I have a few questions.
1) I believe I am failing to see why my description of a linked list is "wrong", an array with each "cell" having 2 parts, 1)First part contains data 2) The Address of the NEXT "cell" except for the last one that contains the address of 0 (NULL)
2)I am having some problems coming up with algorithms for assignments dealing with this, are there any tips, tricks, or advice I could use to get this down faster?
3)I am starting to seriously wonder myself, (from a business stand point) how advanced is the stuff I am doing now, compared to projects out in the field? Is this still "newbie" stuff, or is this more advanced work?
2006-11-28
09:00:45
·
3 answers
·
asked by
D
4