4. Here is a modified version of Kadane's Algorithm which starts from the right side and goes to [9 pts] the left: n = length (A) i = n - 1 maxoverall = A[i] maxendingati = A[i] print (A[i], maxendingati, maxoverall) for i = n-2 down to 0 inclusive: end maxendingati = max (maxendingati+A[i],A[i]) maxoverall = max (maxoverall, maxendingati) print (A[i], maxendingati, maxoverall) We run this algorithm on an unknown list of length 5 and look at the results of the print statements. The print statement executes five times. Fill in the missing information below: Which Print A[i] maxendingati First Time Second Time Third Time -8 Fourth Time Fifth Time 2 10 6 maxoverall 3 3
4. Here is a modified version of Kadane's Algorithm which starts from the right side and goes to [9 pts] the left: n = length (A) i = n - 1 maxoverall = A[i] maxendingati = A[i] print (A[i], maxendingati, maxoverall) for i = n-2 down to 0 inclusive: end maxendingati = max (maxendingati+A[i],A[i]) maxoverall = max (maxoverall, maxendingati) print (A[i], maxendingati, maxoverall) We run this algorithm on an unknown list of length 5 and look at the results of the print statements. The print statement executes five times. Fill in the missing information below: Which Print A[i] maxendingati First Time Second Time Third Time -8 Fourth Time Fifth Time 2 10 6 maxoverall 3 3
Related questions
Question
READ THE FULL TABLE BEFORE AWNSERING
DO NOT USE AI LIKE THE LAST PERSON DID
![4. Here is a modified version of Kadane's Algorithm which starts from the right side and goes to [9 pts]
the left:
n = length (A)
i = n - 1
maxoverall = A[i]
maxendingati = A[i]
print (A[i], maxendingati, maxoverall)
for i = n-2 down to 0 inclusive:
end
maxendingati = max (maxendingati+A[i],A[i])
maxoverall = max (maxoverall, maxendingati)
print (A[i], maxendingati, maxoverall)
We run this algorithm on an unknown list of length 5 and look at the results of the print
statements. The print statement executes five times. Fill in the missing information below:
Which Print
A[i]
maxendingati
First Time
Second Time
Third Time
-8
Fourth Time
Fifth Time
2
10
6
maxoverall
3
3](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F6fb406b3-dfb5-4d65-a424-9ec71ae4c6de%2Fae1c60cd-f9d4-43c2-92e1-82fdac83fff1%2Fanmzvb_processed.png&w=3840&q=75)
Transcribed Image Text:4. Here is a modified version of Kadane's Algorithm which starts from the right side and goes to [9 pts]
the left:
n = length (A)
i = n - 1
maxoverall = A[i]
maxendingati = A[i]
print (A[i], maxendingati, maxoverall)
for i = n-2 down to 0 inclusive:
end
maxendingati = max (maxendingati+A[i],A[i])
maxoverall = max (maxoverall, maxendingati)
print (A[i], maxendingati, maxoverall)
We run this algorithm on an unknown list of length 5 and look at the results of the print
statements. The print statement executes five times. Fill in the missing information below:
Which Print
A[i]
maxendingati
First Time
Second Time
Third Time
-8
Fourth Time
Fifth Time
2
10
6
maxoverall
3
3
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
