Sorting Algorithms Quiz 1

What does in-place sorting mean in Bubble Sort?

• Requires additional memory

• Does not require additional memory

• Uses external storage

• Needs more space

What does adaptive mean in the context of Insertion Sort?

• Performs worse when partially sorted

• Performs better when partially sorted

• Requires more operations

• Uses more memory

What is a disadvantage of Insertion Sort?

• Efficient for large datasets

• Inefficient for large datasets

• Fast for large datasets

• Uses less memory

What is a key feature of Insertion Sort?

• Requires external storage

• In-place sorting

• High memory usage

• Complex implementation

What is a disadvantage of Bubble Sort on large datasets?

• Efficient

• Poor performance

• Fast sorting

• Low memory usage

What is a benefit of using Insertion Sort for small datasets?

• Inefficient

• Efficient

• Complex

• Slow

What is a feature of Bubble Sort?

• High space complexity

• Unstable sorting

• High time complexity for large datasets

• Best for large datasets

What is a benefit of using Merge Sort for external sorting?

• It is very fast.

• It can easily split and merge data.

• It requires no additional memory.

• It is simple to implement.

Which sorting algorithm is best for educational purposes?

• Bubble Sort

• Insertion Sort

• Merge Sort

• Quick Sort

Which sorting algorithm is best for sorting data in real-time?

• Bubble Sort

• Insertion Sort

• Merge Sort

• Quick Sort