On Wed, 2007-10-17 at 17:55 -0700,
je*************@yahoo.com wrote:
Does anybody know how to develop a queue class based on circular
chasing pointers with an integer dynamic array and develop a queue
class based on an integer linked list. Compare the performance based
on insertion and removal of various numbers of integers based on your
test plan.
Your prof/teacher might well read this newsgroup you know...
Hint, draw some circular chasing pointers, name everything on the
drawing, then write the code.
It really helps to use a drawing on a new problem.
On comparing the performance one would need the rest of your assignment
to know what that sentence requires.
--
Tristan Wibberley
Any opinion expressed is mine (or else I'm playing devils advocate for
the sake of a good argument). My employer had nothing to do with this
communication.