Sorting Algorithms Quiz

Which step of Heapsort involves transforming the given array into a heap?

• Step 1: Transform Given Array into a Heap

• Step 2: Repeatedly Partition Transformed Array into 'Heap' and 'Sorted' Regions

• Step 1: Move largest item from 'Heap' region into 'Sorted' region

• Step 2: Apply HeapifySemiheap to the first element of the array

What is the main idea behind Mergesort?

• Transform the given array into a heap

• Merge two sorted subarrays into one sorted array

• Repeatedly partition the transformed array into 'Heap' and 'Sorted' regions

• Partition the array into two segments using a pivot element

Which algorithm has a worst-case running time of O(n²)?

• Mergesort

• Insertionsort

• Selectionsort

• Quicksort

What is the advantage of Mergesort over Quicksort?

• Mergesort has a faster average-case running time

• Mergesort is more efficient for short arrays

• Mergesort does not require allocating a second array

• Mergesort has a worst-case running time of O(n²)

Which sorting algorithm has a worst-case running time of O(n log n)?

• Quicksort

• Selectionsort

• Insertionsort

• Mergesort

What is the purpose of the partitioning step in Quicksort?

• To transform the given array into a heap

• To repeatedly partition the transformed array into 'Heap' and 'Sorted' regions

• To divide the array into two segments using a pivot element

• To merge two sorted subarrays into one sorted array

Which sorting algorithm requires a temporary array for merging?

• Mergesort

• Insertionsort

• Selectionsort

• Quicksort

What is the time complexity of Heapsort?

• O(n log n)

• O(n)

• O(log n)

• O(n²)

Which step of Heapsort involves moving the largest item from the 'Heap' region into the 'Sorted' region?

• Step 1: Transform Given Array into a Heap

• Step 2: Repeatedly Partition Transformed Array into 'Heap' and 'Sorted' Regions

• Step 1: Move largest item from 'Heap' region into 'Sorted' region

• Step 2: Apply HeapifySemiheap to the first element of the array

What is the main idea behind Quicksort?

• Transform the given array into a heap

• Repeatedly partition the transformed array into 'Heap' and 'Sorted' regions

• Merge two sorted subarrays into one sorted array

• Partition the array into two segments using a pivot element