As we in general, try to solve the problem first; we start with a brute force, simple, algorithm: design it below # write your implementation here def maxProfitBrute(changes): it returns the indices of (i,j) indicating the day to buy and sell respectively to have the maximum profit in a list of prices per day in . Inputs: - changes: the list holding the changes in prices; the value whose index is k represents the change between day and day has at least a single change [two days] Output: - i: the index of the change before which we buy j: the index of the change after which we sell maxProfit: the value of the maximum profit Example: changes - [1,2] that means the price started with ; day 1: it became day 2: it became In that case: (i,j) = (0,1) as we should buy at the first day, and sell after the third day # return the values return (0,0,0)
As we in general, try to solve the problem first; we start with a brute force, simple, algorithm: design it below # write your implementation here def maxProfitBrute(changes): it returns the indices of (i,j) indicating the day to buy and sell respectively to have the maximum profit in a list of prices per day in . Inputs: - changes: the list holding the changes in prices; the value whose index is k represents the change between day and day has at least a single change [two days] Output: - i: the index of the change before which we buy j: the index of the change after which we sell maxProfit: the value of the maximum profit Example: changes - [1,2] that means the price started with ; day 1: it became day 2: it became In that case: (i,j) = (0,1) as we should buy at the first day, and sell after the third day # return the values return (0,0,0)
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![As we in general, try to solve the problem first; we start with a brute force, simple, algorithm: design it below
# write your implementation here
def maxProfitBrute(changes):
it returns the indices of (i,j) indicating the day to buy and sell respectively
to have the maximum profit in a list of prices per day in <changes>.
Inputs:
- changes: the list holding the changes in prices; the value whose index is k represents
the change between day <k> and day <k+1>
<changes> has at least a single change [two days]
Output:
- i: the index of the change before which we buy
j: the index of the change after which we sell
- maxProfit: the value of the maximum profit
Example:
changes = [1, 2]
- that means the price started with <x>;
day 1: it became <x+1>
- day 2: it became <x+3>
In that case: (i,j) = (0,1) as we should buy at the first day, and sell after the third day
# return the values
return (0,0,0)
# Try vour alaorithm](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F249411fb-17e6-4b4c-8be8-accd9a7fc6a1%2Fef117362-08ed-4a74-81c4-d8b1d0791660%2F2e979ri_processed.png&w=3840&q=75)
Transcribed Image Text:As we in general, try to solve the problem first; we start with a brute force, simple, algorithm: design it below
# write your implementation here
def maxProfitBrute(changes):
it returns the indices of (i,j) indicating the day to buy and sell respectively
to have the maximum profit in a list of prices per day in <changes>.
Inputs:
- changes: the list holding the changes in prices; the value whose index is k represents
the change between day <k> and day <k+1>
<changes> has at least a single change [two days]
Output:
- i: the index of the change before which we buy
j: the index of the change after which we sell
- maxProfit: the value of the maximum profit
Example:
changes = [1, 2]
- that means the price started with <x>;
day 1: it became <x+1>
- day 2: it became <x+3>
In that case: (i,j) = (0,1) as we should buy at the first day, and sell after the third day
# return the values
return (0,0,0)
# Try vour alaorithm
![Divide and Conquer
Now, we would try to use a divide and conquer paradigm. Hint: try the three steps, and design multiple versions to master these steps
# write your implementation here
def maxProfit(changes):
This is just an interface for <maxProfitDivide>
it returns the indices of (i,j) indicating the day to buy and sell respectively
to have the maximum profit in a list of prices per day in <changes>.
Inputs:
- changes: the list holding the changes in prices; the value whose index is k represents
the change between day <k> and day <k+1>
<changes> has at least a single change [two days]
Output:
- i: the index of the change before which we buy
j: the index of the change after which we sell
- maxProfit: the value of the maximum profit
return (0,0,0)
maxProfit([13,7,-30,15,10, -5,12,7,-11,6])](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F249411fb-17e6-4b4c-8be8-accd9a7fc6a1%2Fef117362-08ed-4a74-81c4-d8b1d0791660%2Fhj8xdhm_processed.png&w=3840&q=75)
Transcribed Image Text:Divide and Conquer
Now, we would try to use a divide and conquer paradigm. Hint: try the three steps, and design multiple versions to master these steps
# write your implementation here
def maxProfit(changes):
This is just an interface for <maxProfitDivide>
it returns the indices of (i,j) indicating the day to buy and sell respectively
to have the maximum profit in a list of prices per day in <changes>.
Inputs:
- changes: the list holding the changes in prices; the value whose index is k represents
the change between day <k> and day <k+1>
<changes> has at least a single change [two days]
Output:
- i: the index of the change before which we buy
j: the index of the change after which we sell
- maxProfit: the value of the maximum profit
return (0,0,0)
maxProfit([13,7,-30,15,10, -5,12,7,-11,6])
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education