Heap Sort
Sign in to Google to save your progress. Learn more
Student ID *
Student Name *
What's your colleges?
Clear selection
What is the average and worst-case time complexity of heap sort?
 *
Match the following descriptions with the correct sorting algorithm (heap sort, merge sort, insertion sort, or quick sort):
 *
Insertion sort
Quick sort
Merge sort
Heap sort
Builds a binary heap to sort the elements
Compares and inserts elements one at a time
Uses a divide and conquer approach
Has an average case time complexity of O(n log n)
Has a worst-case time complexity of O(n^2)
Requires additional memory to store subarrays

Given the following list of integers, show the steps of heap sort to sort the list in ascending order. List: [12, 11, 13, 5, 6, 7]. In the first step, a max heap should be constructed. What could it be?

*
Captionless Image
Given the previous question, show the heap results in the middle steps of heap sort: *
Heap: [6, 5, 7, 11, 12, 13]
Heap: [7, 6, 5, 11, 12, 13]
Heap: [11, 6, 7, 5, 12, 13]
Heap: [5, 6, 7, 11, 12, 13]
Heap: [12,11,7,5,6,13]
Step 1
Step 2
Step 3
Step 4
Step 5

Which of the following sorting algorithms is not stable?

*
Required
Which sorting algorithm is best suited for sorting large datasets that do not fit in memory?
 *
Submit
Clear form
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google. - Terms of Service - Privacy Policy

Does this form look suspicious? Report

Google Forms