Q. What is the primary advantage of using Quick Sort over Merge Sort?
-
A.
Less memory usage
-
B.
Stable sorting
-
C.
Better worst-case performance
-
D.
Simplicity of implementation
Solution
The primary advantage of Quick Sort over Merge Sort is less memory usage, as Quick Sort is an in-place sorting algorithm.
Correct Answer:
A
— Less memory usage
Learn More →
Q. Which of the following is a stable sorting algorithm?
-
A.
Quick Sort
-
B.
Heap Sort
-
C.
Merge Sort
-
D.
Selection Sort
Solution
Merge Sort is a stable sorting algorithm, meaning it maintains the relative order of equal elements.
Correct Answer:
C
— Merge Sort
Learn More →
Q. Which sorting algorithm is considered the most efficient for large datasets?
-
A.
Bubble Sort
-
B.
Insertion Sort
-
C.
Quick Sort
-
D.
Selection Sort
Solution
Quick Sort is generally considered the most efficient for large datasets due to its average-case time complexity of O(n log n).
Correct Answer:
C
— Quick Sort
Learn More →
Showing 1 to 3 of 3 (1 Pages)
