Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Sorting
Consider the following statements about heap sort algorithm:
A. The MAX-HEAPIFY procedure which runs in O lg (n) time, is the key to maintaining the max heap property
B. The BUILD-MAX-HEAP procedure, which runs in O lg (n) time, produces max-heap from an unordered input array
C. The MAX-HEAP-INSERT, which runs in O (lg n) time, implements the insertion operation
D. The HEAP-INCREASE-KEY procedure runs in O (n lg n) time, to set the key of new node of its correct value
Choose the correct answer from the options given below:
1
A, B only
2
A, C only
3
B, D only
4
A, B, C, D