AP CSA Searching and Sorting Algorithms 1

Question 1

What is the time complexity of linear search in the worst case?

Accepted Answer

O(n)

Answer

O(log n)

Answer

O(n²)

Answer

O(1)

Question 2

What precondition must be met before applying binary search to an array?

Accepted Answer

The array must be sorted

Answer

The array must have an even number of elements

Answer

The array must contain unique elements

Answer

The array must be of type int

Question 3

What is the worst-case time complexity of binary search?

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n log n)

Answer

O(1)

Question 4

Which sorting algorithm repeatedly finds the minimum element and places it at the beginning?

Accepted Answer

Selection sort

Answer

Bubble sort

Answer

Insertion sort

Answer

Merge sort

Question 5

In bubble sort, what happens during each pass through the array?

Accepted Answer

Adjacent elements are compared and swapped if out of order

Answer

The minimum element is found and moved to the front

Answer

Elements are inserted into their correct position

Answer

The array is divided in half

Question 6

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

Accepted Answer

O(n²)

Answer

O(n)

Answer

O(log n)

Answer

O(n log n)