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

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 Correct Answer O(n*logn)

The total time taken will be N times the complexity of adding a single element to the heap. And adding a single element takes logN time, so That is equal to N*logN.
Bissoy MCQ

Related Questions

You want to provide complete redundancy for all data stored on your hardware RAID 5 array. You install second h/w Raid 5. You want to create a mirror set of the original array. However when you right click the free space on new array you see no option to create a new volume or mirrrored volume. What should you do?
A material is loaded elastically under plane stress condition given by the following tensor:
\[\left[ {\begin{array}{*{20}{c}} 1 \\ 0 \end{array}\begin{array}{*{20}{c}} 2 \\ 1 \end{array}\begin{array}{*{20}{c}} 0 \\ 0 \end{array}} \right
Statement 1: In insertion sort, after m passes through the array, the first m elements are in sorted order. Statement 2: And these elements are the m smallest elements in the array.
Which of the following accesses the seventh element stored in array? ; b) array; c) array(7); d) array;
Which of the following gives the memory address of the first element in array? ; b) array; c) array(2); d) array;
Which of the following is a two-dimensional array? b) int array c) int array d) char array
What will the following script output?
$array = array (1, 2, 3, 5, 8, 13, 21, 34, 55);
$sum = 0;
for ($i = 0; $i $sum += $array[$array[$i
If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value will be at leaf nodes of the right subtree of the heap.
The essential part of Heap sort is construction of max-heap. Consider the tree shown below, the node 24 violates the max-heap property. Once heapify procedure is applied to it, which position will it be in?