Question: 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
Options
A : O(n*n*logn)
B : O(n*logn)
C : O(n*n)
D : O(n *logn *logn)
Data Structure Heap more questions
What is the worst case time complexity of bead sort....
You are given infinite coins of N denominations v1, v2,....
What is the time complexity improvement of skip lists from....
What are the worst case and average case complexities of....
Worst case complexity of Breadth First Search traversal __________
What will be the auxiliary space requirement (excluding call stack)....
What is the average case time complexity of cycle sort?
What is the worst case time complexity of comb sort?
What is the average case time complexity of cube sort?
What is the best case time complexity of cycle sort?
Data Structure Adjacency List more Online Exam Quiz
Data Structure Generating Combinations
Data Structure Generating Partitions
Data Structure Generating Subsets
Data Structure Incidence Matrix Graph Structured Stack
Data Structure Inorder Traversal