An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

M

Mr. Dubey • 52.26K Points
Coach

Q. An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

(A) O(n*n*logn)

(B) O(n*logn)

(C) O(n*n)

(D) O(n *logn *logn)

Correct : Option (B)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. physical layer provides

Q. ____________ is a mono-alphabetic encryption code wherein each & every letter of plaintext is replaced by another letter in creating the cipher-te

Q. A fact is said to be fully additive if_________.

Q. Making different sub-system to work together is

Q. Dijkstra’s Algorithm run on a weighted, directed graph G={V,E} with non-negative weight function w and source s, terminates with d[u]=delta(s,u)

Q. File type can be represented by

Q. Conversion of fractional number 0.6875 into its equivalent binary number:

Q. Unit testing is done by

Q. The computation of the shortest path in OSPF is usually done by ____________

Q. Sustainable Development focuses on more use of: