CONCEPT PRACTICE

Heap sort by root extraction

2 related verified questions. Take them one at a time.

Filter questionsFrom yearTo year

Question sourcesITPEC PracticeHistorical PDFsTextbook Exercises

Unanswered onlyInclude Japan-specific questions

2 of 2 questions match.

ITPEC Practice: 0/1 answered
Textbook Exercises: 0/1 answered

Question 1 of 2

0/2 answered

2024 Autumn · Subject A · Q3

Original 2024 Autumn · Subject A, question 3. Accessible description follows. — Original exam question · Select the image to enlarge

Read the question as text

Which of the following is the computational complexity of the Heapsort algorithm? Here, n is the number of elements to be sorted, and all comparisons, swaps, and other needed operations can proceed in constant time.

The original image above preserves the complete exam wording and layout.

1 / 2

Source: 2024A_FE-A_Questions.pdf, PDF page 4. ID: 2024A-A-Q003. Explanation written for this textbook.