Question 1

The best sorting algorithms provide ____ average-case behavior and are considerably faster for large arrays. A) O(1) B) O(n) C) O(n²) D) O(n log n)

Accepted Answer

The best sorting algorithms, such as quicksort and mergesort, have an average-case time complexity of O(n log n), making them considerably faster for sorting large arrays compared to algorithms with higher time complexities.

Question 2

Which of the following generally gives the worst performance?
A) Selection sort
B) Bubble sort
C) Insertion sort
D) Shell sort

Accepted Answer

Bubble sort generally gives the worst performance among the options listed due to its average and worst-case time complexity of O(n^2), where n is the number of items being sorted. It repeatedly swaps adjacent elements if they are in the wrong order, which is highly inefficient for large datasets compared to the more sophisticated algorithm like Shell sort, or even the simpler insertion and selection sorts which can perform better under certain conditions.

Question 3

Shell sort is ____ if successive powers of 2 are used for gap. A) O(log n) B) O(1) C) O(log₂n) D) O(n²)

Accepted Answer

The answer of Shell sort is ____ if successive powers...

Question 4

The following represents the algorithm for ____ sort.
For each array element from the second (nextPos = 1) to the last
Insert the element at nextPos where it belongs in the array, increasing
The length of the sorted subarray by 1 element.
A) merge
B) shell
C) selection
D) insertion

Accepted Answer

The described algorithm is for insertion sort. It iterates through the array, inserting each new element into the correct position within the already sorted section of the array, thereby expanding the sorted section by one element with each iteration.

Question 5

The following is the ____ algorithm.
Build a heap by rearranging the elements in an unsorted array.
While the heap is not empty
Remove the first item from the heap by swapping it with the last item in the heap
And restoring the heap property.
A) Quicksort
B) Bubble sort
C) Merge sort
D) In-Place Heapsort

Accepted Answer

The described algorithm is In-Place Heapsort, which involves building a heap from the unsorted array and then repeatedly removing the largest element and restoring the heap property until the heap is empty.

Quiz 8: Sorting

The best sorting algorithms provide ____ average-case behavior and are considerably faster for large arrays.

Which of the following generally gives the worst performance?

Shell sort is ____ if successive powers of 2 are used for gap.

The following represents the algorithm for ____ sort. For each array element from the second (nextPos = 1) to the last Insert the element at nextPos where it belongs in the array, increasing The length of the sorted subarray by 1 element.

The following is the ____ algorithm. Build a heap by rearranging the elements in an unsorted array. While the heap is not empty Remove the first item from the heap by swapping it with the last item in the heap And restoring the heap property.