Question
a.
O(n*n*logn)
b.
O(n*logn)
c.
O(n*n)
d.
O(n *logn *logn)
Posted under Trees Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
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
Similar Questions
Discover Related MCQs
Q. Min heap can be used to implement selection sort.
View solution
Q. Which one of the following array elements represents a binary min heap?
View solution
Q. Given an array of element 5, 7, 9, 1, 3, 10, 8, 4. Which of the following is the correct sequences of elements after inserting all the elements in a min-heap?
View solution
Q. What is the amortized cost per operation of a skew heap?
View solution
Q. How do you allocate a matrix using a single pointer in C? (M and N are the number of rows and columns respectively)
View solution
Q. Which of the following don't use matrices?
View solution
Q. What is the relation between Sparsity and Density of a matrix?
View solution
Q. Who coined the term Matrix?
View solution
Q. Who coined the term Sparse Matrix?
View solution
Q. Which of the following is not the method to represent Sparse Matrix?
View solution
Q. Which one of the following is a Special Sparse Matrix?
View solution
Q. Which of the following is the way to represent Sparse Matrix?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
