Question

I'd like to see the correct answer. Question #4 (30 points). Provide clear, concise answers to each of the following questions concerning the following code to perform a linear search through an input array: 1 Linear-Search (A, low, high, item) 2 \quad found\_index = 0 3 \quad for $i = low$ to $high$ 4 \qquad if $A[i] = item$ 5 \qquad \quad $found\_index = i$ 6 \quad return ($found\_index$) \textbullet (20 points.) Carefully prove each clause of the following loop invariant: \textendash (10 points). if ($item \notin A[low: i-1]$), then ($found\_index = 0$) \textendash (10 points). if ($item \in A[low: i-1]$), then ($item = A[found\_index]$) \textbullet (10 points). Prove the correctness of Linear-Search().

          I'd like to see the correct answer.
Question #4 (30 points).
Provide clear, concise answers to each of the following questions concerning the following code
to perform a linear search through an input array:
1 Linear-Search (A, low, high, item)
2 \quad found\_index = 0
3 \quad for $i = low$ to $high$
4 \qquad if $A[i] = item$
5 \qquad \quad $found\_index = i$
6 \quad return ($found\_index$)
\textbullet (20 points.) Carefully prove each clause of the following loop invariant:
\textendash (10 points). if ($item \notin A[low: i-1]$), then ($found\_index = 0$)
\textendash (10 points). if ($item \in A[low: i-1]$), then ($item = A[found\_index]$)
\textbullet (10 points). Prove the correctness of Linear-Search().

I'd like to see the correct answer.
Question #4 (30 points).
Provide clear, concise answers to each of the following questions concerning the following code
to perform a linear search through an input array:
1 Linear-Search (A, low, high, item)
2 found= 0
3 for i = low to high
4 if A[i] = item
5 found = i
6 return (found)
•(20 points.) Carefully prove each clause of the following loop invariant:
–(10 points). if (item ∉ A[low: i-1]), then (found = 0)
–(10 points). if (item ∈ A[low: i-1]), then (item = A[found])
•(10 points). Prove the correctness of Linear-Search().

Added by Joseph M.

Question

Please give Ace some feedback