Sorting Algorithms Quiz

What is the worst-case time complexity of Selection Sort?

• O(n)

• O(n log n)

• O(n^2)

• O(log n)

Answer explanation

Selection Sort has a worst-case time complexity of O(n^2) due to its nested loops for finding the minimum element and swapping it with the current element.

Which of the following is true for Selection Sort?

• It is the most efficient sorting algorithm.

• It improves time complexity by making only one exchange for every pass through the list.

• It is more complex than Quick Sort.

• It is significantly faster than Bubble Sort in practical scenarios.

Answer explanation

The correct choices are that Selection Sort improves time complexity by making only one exchange for every pass through the list and it is significantly faster than Bubble Sort in practical scenarios.

Which sorting algorithm builds the final sorted array one item at a time?

• Bubble Sort

• Selection Sort

• Insertion Sort

• Merge Sort

Answer explanation

Insertion Sort builds the final sorted array one item at a time by taking each element and inserting it into its correct position in the sorted array.

What is the best case time complexity of Bubble Sort?

• O(n log n)

• O(n^2)

• O(n)

• O(log n)

Answer explanation

Bubble Sort has a best case time complexity of O(n) when the array is already sorted, as it only requires one pass to check if any swaps are needed.

In which sorting technique is the entire list divided into two parts: the sorted part at the left end and the unsorted part at the right end?

• Bubble Sort

• Insertion Sort

• Selection Sort

• Quick Sort

Answer explanation

In Insertion Sort, the list is divided into two parts: the sorted part on the left and the unsorted part on the right, making it the correct choice for the given scenario.

Which sorting algorithm repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order?

• Selection Sort

• Merge Sort

• Bubble Sort

• Insertion Sort

Answer explanation

Bubble Sort repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order, making it the correct choice for the given question.

How does Bubble Sort behave if the list is already sorted?

• It does not perform any operations.

• It performs a single pass through the list to confirm it is sorted.

• It behaves the same way as if the list were unsorted.

• It immediately recognizes the list is sorted and stops.

Answer explanation

The Bubble Sort algorithm will perform a single pass through the list to confirm it is already sorted, making it the correct choice.

During the insertion sort process, what is the initial size of the sorted subarray?

• 0

• 1

• 2

• Depends on the array

Answer explanation

The initial size of the sorted subarray during the insertion sort process is 1, as the first element is considered as a sorted subarray by itself.

Which of the following sorting algorithms can be easily adapted to sort a list in place, meaning without requiring additional storage space?

• Merge Sort

• Quick Sort

• Selection Sort

• Radix Sort

Answer explanation

Quick Sort can be easily adapted to sort a list in place without requiring additional storage space by using a partitioning technique to rearrange elements within the array.

In Insertion Sort, which of the following statements is correct?

• The array is imagined to be divided into two parts: sorted and unsorted.

• Every new element is compared with the last element of the sorted array.

• It is preferred for sorting large datasets.

• It utilizes a divide-and-conquer strategy.

Answer explanation

The correct statements are that the array is divided into sorted and unsorted parts, and every new element is compared with the last element of the sorted array in Insertion Sort.