AP CSA Searching and Sorting Algorithms 2

Question 1

In insertion sort, how are elements processed?

Accepted Answer

Each element is inserted into its correct position among already-sorted elements

Answer

Adjacent elements are swapped if out of order

Answer

The minimum is selected and moved front

Answer

The array is recursively divided

Question 2

Which of the following sorts has average-case time complexity of O(n log n)?

Accepted Answer

Merge sort

Answer

Bubble sort

Answer

Selection sort

Answer

Insertion sort

Question 3

What does `Arrays.sort(arr)` use internally in Java for primitive arrays?

Accepted Answer

A variant of quicksort (dual-pivot quicksort)

Answer

Merge sort

Answer

Bubble sort

Answer

Insertion sort

Question 4

How many comparisons does binary search make in the worst case on an array of 16 elements?

Accepted Answer

4

Answer

16

Answer

8

Answer

2

Question 5

Which sort is stable (preserves relative order of equal elements) in AP CSA context?

Accepted Answer

Merge sort

Answer

Selection sort

Answer

Quicksort

Answer

Heap sort

Question 6

What is the best-case time complexity of bubble sort when the array is already sorted?

Accepted Answer

O(n)

Answer

O(n²)

Answer

O(log n)

Answer

O(1)