Crossword Time!

2. , __________ search checks each element sequentially until the target is found.
3. , For binary search, the array must be __________.
8. , In binary search, the worst-case number of comparisons is _ (______).
9. , In a linear search, the best-case scenario occurs when the target is at the __________.
11. , The __________ search algorithm jumps ahead by fixed steps to reduce the number of comparisons.
12. , In ternary search, the array is divided into __________ parts.
14. , __________ sort selects the smallest element from the unsorted region and swaps it with the first unsorted element.
15. The __________ sorting algorithm is ideal for sorting linked lists because it requires minimal data movement.

1. , The __________ search algorithm uses a formula to guess the position of the target.
4. The __________ sorting algorithm works by repeatedly swapping adjacent elements if they are in the wrong order.
5. , __________ sort is an efficient, unstable sorting algorithm that uses a pivot element to partition the array.
6. __________ sort is efficient for sorting small arrays due to its low constant factors, despite having O(n^2) time complexity.
7. , The __________ search algorithm divides the search interval in half repeatedly to find a target in a sorted array.
10. __________ sort is a non-comparison-based sorting algorithm that works by distributing elements into buckets.
13. , The __________ search algorithm is similar to binary but divides the array into more parts instead of two.