Answer to Question #246979 in Programming & Computer Science for Michael Sampson

Question

1.Create a class to implement a queue using a circular array<o:p></o:p>

 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.

b.For each function above perform an asymptotic analysis and state the worst case performance of the algorithm

Answer 1

Dear Michael Sampson, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order