Answer:
A.O(1)
Explanation:
In the implementation of queue by using linked chain the performance of the enqueue operation is O(1).We have to maintain two pointers one head and the other tailand for enqueue operation we have to insert element to the next of the tail and then make that element tail.Which takes O(1) time.
Answer:
The answer to this question is given below in the explanation section.
Explanation:
The selection sort algorithm step started from 0, and continue till the sorting is done.
The correct answer after selection sort algorithm at the 4th step is:D
[0,1,2,4,8,10].
The complete detail of step by step execution is shown in the attached document file.
Answer:
2that is the question??? then many I could help