1. Create a class to implement a queue using a circular array
a. The class should contain functions to
i. Insert a new value,
ii. Delete a value.
iii. Change a value equal to X to a value equal to Y.
iv. Count all value equal to X in the queue.
For each function above perform an asymptotic analysis and state the worst case performance of the algorithm.
Comments
Leave a comment