Computer Science · Analysis of Algorithms
Consider the following statements about the 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 a max-heap from an unordered input array. C. The MAX-HEAP-INSERT procedure, 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 a new node to its correct value. Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A and B only
- 2A and C only✓
- 3B and D only
- 4A, B, C and D
Correct answer
A and C only
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Analysis of Algorithms MCQs →Want more practice questions on Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Analysis of Algorithms