Thursday 28 May 2015

Q28,paper 2,J 13.The time complexity to build a heap with a list of n numbers is



(A) O(log n)
(B) O(n)
(C) O(n logn)
(D) O(n2)
Answer B
Posted by at

No comments:

Post a Comment

Note: only a member of this blog may post a comment.

Subscribe to: Post Comments (Atom)