Data Structures
•Efficiency Discussion of a Circular Array:
–Progressing the indices is not as simple as just adding
1 with the increment operator
(++front) which reduces the gain achieved
from direct access
–Still has fixed size memory limitations that we examined
with stacks
•do we know at compile time the maximum size
•is there are large variance in the size
–At least no shifting should be required (unless it is implemented incorrectly!)
•