Group 6 - Flashcard

Front

Which sorting algorithm is the best choice for nearly sorted data? Options: Merge Sort, Quick Sort, Insertion Sort, Bubble Sort

Back

Insertion Sort

Front

In Quick Sort, if we always choose the smallest element as the pivot, what is the worst-case time complexity?

Back

O(n²)

Front

If an array is already sorted, which sorting algorithm performs the best? Options: Quick Sort, Merge Sort, Bubble Sort, Insertion Sort

Back

Insertion Sort

Front

What is the primary disadvantage of Merge Sort?

Back

Requires extra memory

Front

Which sorting algorithm will always take the same time for sorting any input? Options: Quick Sort, Merge Sort, Bubble Sort, Insertion Sort

Back

Merge Sort

Front

When does Bubble Sort perform the fewest swaps?

Back

When the array is already sorted

Front

If Merge Sort is applied to a 1 billion element dataset, what makes it a better choice than Quick Sort?

Back

Quick Sort degrades to O(n²) in worst case while Merge sort guarantees O(n log n) even in worst case.

Front

In which sorting algorithm does swapping depend on comparisons with neighboring elements? Options: Merge Sort, Quick Sort, Insertion Sort, Bubble Sort

Back

Bubble Sort

Front

What happens in Quick Sort if we always choose the last element as the pivot?

Back

It becomes O(n²) in the worst case

Front

What is the major reason Quick Sort is faster than Bubble Sort?

Back

It avoids unnecessary swaps