Sorting Algorithms Quiz

What is the time complexity of Bubble Sort?

• Ο(n2)

• Ο(n log n)

• Ο(n)

• Ο(1)

In Bubble Sort, what happens when a pair of adjacent elements are not in order?

• They are left unchanged

• They are removed from the array

• The algorithm stops

• They are swapped

In Insertion Sort, what is compared with the key element to determine its position?

• The previous elements

• The largest element

• The first element

• The next element

What is the main characteristic of Selection Sort?

• It uses recursion

• It has a time complexity of Ο(n log n)

• It compares every pair of elements

• It divides the list into two parts

In Selection Sort, what is the first position where the minimum value is searched?

• A random position

• The last position

• The middle position

• The first position

What is the main disadvantage of Bubble Sort?

• It is not a comparison-based algorithm

• It is not suitable for large data sets

• It has a time complexity of Ο(n log n)

• It is not suitable for small data sets

What is the main advantage of Insertion Sort?

• It has a time complexity of Ο(n2)

• It is suitable for small data sets

• It is a comparison-based algorithm

• It is suitable for large data sets

What is the main advantage of Selection Sort?

• It is suitable for large data sets

• It is a comparison-based algorithm

• It is suitable for small data sets

• It has a time complexity of Ο(n2)

What is the main disadvantage of Insertion Sort?

• It is not a comparison-based algorithm

• It is not suitable for large data sets

• It has a time complexity of Ο(n log n)

• It is not suitable for small data sets

What is the main disadvantage of Selection Sort?

• It is not suitable for large data sets

• It has a time complexity of Ο(n log n)

• It is not a comparison-based algorithm

• It is not suitable for small data sets