Part B: Problem 4: Describe specific loop invariant(s) for proving correct- ness for each of the following algorithms. You do not have to prove that the algorithms are correct: (a) def find min (A): min =A[0] for i in range(1, len (A)): if min A[i]: min =A[i] return min (b) def find_max (A): for i in range(0, len (A)): isMax = True for j in range(0, len(A)): if A[j] > A[i]: if isMax: isMax False return A[i] (c) def even numbers (A): E = [] for i in range(0, len (A)): if A[i]%2== 0: return E E.append(A[i]) (d) def double_array(A): for i in range(0, len (A)): A[i] [i] ✶ 2 return A (e) def dot product (A, B): sum = 0.0 for i in range(0, min(len(A), len (B))): sum sum + A[i]*B[i] return sum
Part B: Problem 4: Describe specific loop invariant(s) for proving correct- ness for each of the following algorithms. You do not have to prove that the algorithms are correct: (a) def find min (A): min =A[0] for i in range(1, len (A)): if min A[i]: min =A[i] return min (b) def find_max (A): for i in range(0, len (A)): isMax = True for j in range(0, len(A)): if A[j] > A[i]: if isMax: isMax False return A[i] (c) def even numbers (A): E = [] for i in range(0, len (A)): if A[i]%2== 0: return E E.append(A[i]) (d) def double_array(A): for i in range(0, len (A)): A[i] [i] ✶ 2 return A (e) def dot product (A, B): sum = 0.0 for i in range(0, min(len(A), len (B))): sum sum + A[i]*B[i] return sum
Related questions
Question
I need help with this question please
![Part B: Problem 4: Describe specific loop invariant(s) for proving correct-
ness for each of the following algorithms. You do not have to prove that the
algorithms are correct:
(a) def find min (A):
min =A[0]
for i in range(1, len (A)):
if min
A[i]:
min =A[i]
return min
(b) def find_max (A):
for i in range(0, len (A)):
isMax = True
for j in range(0, len(A)):
if A[j] > A[i]:
if isMax:
isMax False
return A[i]
(c) def even numbers (A):
E = []
for i in range(0, len (A)):
if A[i]%2== 0:
return E
E.append(A[i])
(d) def double_array(A):
for i in range(0, len (A)):
A[i] [i] ✶ 2
return A
(e) def dot product (A, B):
sum = 0.0
for i in range(0, min(len(A), len (B))):
sum sum + A[i]*B[i]
return sum](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0f62546d-7f38-4c58-9a2f-5b5f08b48195%2Fae86117a-3b8a-48f5-b2f6-fa7b32966898%2Fby8xny_processed.png&w=3840&q=75)
Transcribed Image Text:Part B: Problem 4: Describe specific loop invariant(s) for proving correct-
ness for each of the following algorithms. You do not have to prove that the
algorithms are correct:
(a) def find min (A):
min =A[0]
for i in range(1, len (A)):
if min
A[i]:
min =A[i]
return min
(b) def find_max (A):
for i in range(0, len (A)):
isMax = True
for j in range(0, len(A)):
if A[j] > A[i]:
if isMax:
isMax False
return A[i]
(c) def even numbers (A):
E = []
for i in range(0, len (A)):
if A[i]%2== 0:
return E
E.append(A[i])
(d) def double_array(A):
for i in range(0, len (A)):
A[i] [i] ✶ 2
return A
(e) def dot product (A, B):
sum = 0.0
for i in range(0, min(len(A), len (B))):
sum sum + A[i]*B[i]
return sum
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
