Understanding Sorting Algorithms Quiz

What is the primary operation performed repeatedly in a bubble sort algorithm?

• Swapping adjacent elements

• Inserting elements into their correct position

• Selecting the smallest element

• Merging two sorted lists

Which of the following best describes the first step in the insertion sort process?

• Compare the first two elements and swap if necessary

• Select the smallest element and place it at the beginning

• Take the second element and compare it with the first

• Divide the list into two halves

In selection sort, what is the main task performed in each iteration?

• Inserting elements into their correct position

• Swapping the first and last elements

• Selecting the smallest element and swapping it with the first unsorted element

• Merging two sorted lists

What is the average time complexity of bubble sort?

Which sorting algorithm is generally more efficient for small datasets, bubble sort or insertion sort, and why?

• Bubble sort, because it has a lower time complexity

• Insertion sort, because it performs fewer swaps on average

• Bubble sort, because it is easier to implement

• Insertion sort, because it is a stable sort

Fill in the blank: The time complexity of selection sort in the worst case is ______.

How does the time complexity of insertion sort compare to bubble sort in the best-case scenario?

Which sorting algorithm is considered the most efficient for nearly sorted data?

• Bubble sort

• Insertion sort

• Selection sort

• Quick sort

What is a key disadvantage of selection sort compared to bubble sort and insertion sort?

• It is not a stable sort

• It requires additional memory

• It has a higher time complexity

• It is difficult to implement

Which of the following statements is true regarding the efficiency of bubble sort, insertion sort, and selection sort?

• All three have the same average time complexity

• Bubble sort is generally faster than insertion sort

• Selection sort is the most efficient for large datasets

• Insertion sort is generally more efficient than bubble sort for small datasets