Indicate the Big-O rate of growth of run-time for:


a) Insertion into a queue that is implemented using and ordinary array with the front of the queue always maintained in component zero of the array.

b) Deletion from a queue that is implemented using an ordinary component zero of the array.

c) Deletion from a queue using a circular array implementation.



Answer :

Other Questions