Array Search & Sort Quiz

What is the time complexity of the best case for linear search in an array?

In binary search, the array must be:

• Unsorted

• Sorted in descending order

• Sorted in ascending order

• Sorted or unsorted

What is the worst-case time complexity of bubble sort?

During selection sort, what happens in each iteration?

• The smallest element is moved to the end of the array.

• The largest element is moved to the beginning of the array.

• The smallest element is moved to its correct position.

• The array is divided into two parts.

Which of the following is true about insertion sort?

• It is more efficient on large lists than selection sort.

• It builds the final sorted array one item at a time.

• It is not suitable for small data sets.

What does array traversal mean?

• Sorting the array

• Accessing each element of the array once

• Deleting elements from the array

• Increasing the size of the array

Which of the following is not a characteristic of binary search?

• It is a divide and conquer algorithm.

• It can be used on unsorted arrays.

• It repeatedly divides the search interval in half.

What is the space complexity of bubble sort?

In which case does insertion sort perform the best?

• When the array is in reverse order

• When the array is nearly sorted

• When the array is completely unsorted

• When the array has all elements the same

How does selection sort find the minimum element?

• By scanning the entire list for the smallest element

• By comparing only adjacent elements

• By using a binary search technique

• By moving the first element to the end of the array and then finding the minimum