DSA_Unit3

Which of the following sorting algorithms has the worst-case time complexity of O(n²)?

• Merge Sort

• Quick Sort

• Bubble Sort

• Radix Sort

Which sorting algorithm works by repeatedly swapping adjacent elements if they are in the wrong order?

• Quick Sort

• Merge Sort

• Bubble Sort

• Selection Sort

In which of the following sorting algorithms does the number of swaps always remain the same for a given input?

• Bubble Sort

• Insertion Sort

• Selection Sort

• Quick Sort

What is the average-case time complexity of Quick Sort?

• O(n)

• O(n log n)

• O(n²)

• O(log n)

Which sorting algorithm works by repeatedly selecting the smallest (or largest) element and placing it in its correct position?

• Merge Sort

• Selection Sort

• Bubble Sort

• Quick Sort

Which sorting algorithm is the most efficient in terms of time complexity for large datasets?

• Bubble Sort

• Quick Sort

• Selection Sort

• Insertion Sort

Merge Sort follows which algorithmic approach?

• Divide and Conquer

• Greedy Algorithm

• Dynamic Programming

• Backtracking

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

• O(n)

• O(n log n)

• O(n²)

• O(log n)

Which sorting algorithm is best for nearly sorted data?

• Quick Sort

• Insertion Sort

• Merge Sort

• Selection Sort

In Quick Sort, the partitioning step involves selecting a:

• Random element

• Middle element

• Pivot element

• Maximum element