When poll is active respond at
PollEv.com​/pds
Send
pds
to
22333
Consider implementing a Priority Queue (PrQUE) with a normal Linked Cell List. What is the worst case time complexity of the "enq" operation for a PrQUE with N items in it?
176
10%
18
O(1)
1%
2
O(log N)
88%
155
O(N)
0%
0
O(N log N)
1%
1
O(N^2)
0%
0
O(2^N)
See more
Powered by