Sorting Algorithms Quiz

What is the time complexity of Bubble Sort?

• O(N^2)

• O(N log N)

• O(1)

• O(N)

Which sorting algorithm is based on the divide-and-conquer approach?

• Merge Sort

• Insertion Sort

• Selection Sort

• Bubble Sort

What is the main characteristic of In-place Sorting algorithms?

• They are always faster than other sorts.

• They sort using the original array.

• They cannot handle large datasets.

• They require additional space.

In which order does the Selection Sort algorithm arrange elements?

• Descending order

• Ascending order

• Non-decreasing order

• Random order

What is the first step in the Selection Sort algorithm?

• Swap the first two elements.

• Find the smallest element.

• Sort the array in reverse.

• Find the largest element.

Which of the following is NOT a characteristic of Heap Sort?

• It can be seen as an optimization over Selection Sort.

• It requires more than one pass.

• It is a comparison-based sorting technique.

• It uses a binary heap data structure.

What does the term 'Non-Decreasing Order' refer to?

• Elements are sorted randomly.

• Elements can be equal or greater than the previous element.

• Elements are sorted in ascending order.

• Elements are sorted in descending order.

What is the auxiliary space complexity of Insertion Sort?

• O(log N)

• O(1)

• O(N^2)

• O(N)

Which sorting algorithm is best suited for large datasets?

• Selection Sort

• Bubble Sort

• Insertion Sort

• Quick Sort

What is the maximum number of comparisons in Bubble Sort for an array of 5 elements?

• 20

• 5

• 10

• 15