When poll is active respond at
Send pds to 22333

We have a sequence of N numbers and we have them all in hand. We decide to sort those numbers using a minimum binary heap. What is the worst case time complexity of producing a sorted sequence of these numbers? We will be as specific as we can here.

164
4%
7
O(log N)
1%
1
O(N)
15%
24
O(N + N log N)
77%
126
O(N log N)
1%
2
O(2^(log N))
2%
4
O(2N log N)
Powered by