When poll is active respond at
Send pds to 22333

Consider a binary heap with 0 elements in it. We have a sequence of N numbers, and we use the special "build" function to construct a heap directly from them. What is the worst case time complexity of building the heap this way?

159
3%
5
O(log N)
87%
138
O(N)
4%
6
O(N + log N)
5%
8
O(N log N)
1%
2
O(N^2)
0%
0
O(2^(log N))
Powered by