Hi, I have a question about a queue class (I found this in Data Structures DeMYSTiFieD by Jim Keogh and Kend Davidson). It seems to me that when you enqueue the first element in a queue object created from this class, the first element in the array will be blank. Have I misunderstood the code or is it not utilizing the whole of the array?
You are correct. In this implementation, the zero index array element is not being utilized. Thus a queue created with a initial size of 3, only holds two items.
Joined: May 12, 2004
Phew, I'm glad to hear I'd understood. Thanks!
Is this way of calculating the front and back of the queue (using modulo arithmetic) a fairly common implementation of a static queue? Also, are there other useful methods that you would normally expect to see in a queue class? I'm guessing the book has presented a rather barebones version in order not to obscure the essential characteristics of queues...
I realize that it might be preferable to use a linked list, though - would just like to make sure I've understood this properly.