Implementing Selection and Iteration Algorithms Practice Test

Given the task requirements, which of the following correctly implements the required loop structure?

Implement insertion sort to sort an integer array in ascending order. Use iteration to shift larger elements to the right, and selection to decide when shifting stops.

Input: $n$, then $n$ integers.

Output: the sorted array.

Constraints: $1 \le n \le 100$; values in -1000, 1000.

Example input:

4

5 2 9 1

Example output:

1 2 5 9

Choose the correct inner loop for insertion sort (assume key = a<u>i</u> and j = i - 1):

Based on the problem description, which of the following correctly implements the required loop structure?

Implement binary search on a sorted integer array to find the index of target. Use iteration to repeatedly narrow the search range and selection (if/else) to choose whether to search left or right. If not found, output -1.

Input: $n$, then $n$ sorted integers, then target.

Output: index of target or -1.

Constraints: $1 \le n \le 1000$; values in -100000, 100000.

Example input:

5

1 4 7 9 12

9

Example output:

3

Choose the correct loop condition for binary search (assume low and high are indices):