0 votes 0 votes Consider the following statements about heap sort algorithm: The MAX-HEAPIFY procedure which runs in $\mathrm{O} \lg (n)$ time, is the key to maintaining the max heap property The BUILD-MAX-HEAP procedure, which runs in $\mathrm{O} \lg (n)$ time, produces max-heap from an unordered input array The MAX-HEAP-INSERT, which runs in $\text{O}$ $(\lg n)$ time, implements the insertion operation The HEAP-INCREASE-KEY procedure runs in $\text{O}$ $(\mathrm{n} \lg n)$ time , to set the key of new node of its correct value Choose the correct answer from the options given below: $\text{A, B}$ only $\text{A, C}$ only $\text{B, D}$ only $\text{A, B, C, D}$ Others ugcnetcse-june2023-paper2 binary-heap algorithms + – admin asked Jul 28, 2023 • edited Jan 30 by makhdoom ghaya admin 437 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Ans : B. A and C are correct. This is taken as it is from CLRS book (Heap chapter). BUILD-MAX-HEAP runs in O(n) time. HEAP-INCREASE-KEY runs in runs in O(lg n) simi2426 answered Jul 31, 2023 simi2426 comment Share Follow See all 0 reply Please log in or register to add a comment.