During tough times like these, investment becomes more uncertain with more dangers. To solve it, we might try to train a model to decide when to buy or sell. Therefore, to provide it with correct data, we plan to design an algorithm that answers: what is the perfect moment to buy and when to sell to maximize your profit? Assume you must buy
During tough times like these, investment becomes more uncertain with more dangers. To solve it, we might try to train a model to decide when to buy or sell. Therefore, to provide it with correct data, we plan to design an algorithm that answers: what is the perfect moment to buy and when to sell to maximize your profit? Assume you must buy
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
During tough times like these, investment becomes more uncertain with more dangers. To solve it, we might try to train a model to decide when to buy or sell. Therefore, to provide it with correct data, we plan to design an
- what is the perfect moment to buy and when to sell to maximize your profit?
Assume you must buy
Input:
???????: array listing ??????? ?? ??? ??????, where indices represent days; it has at least two valueschanges: array listing changes in the prices, where indices represent days; it has at least two values
Output:
???????????:index of the change before which we buy:index of the change before which we sell:the profit of this intervali:index of the change before which we buyj:index of the change before which we sellmaxProfit:the profit of this interval
Example:
Assume the below table contains the prices of a particular stock over days
| ??????prices | ???????changes | |
|---|---|---|
| Day | Value | |
| 0 | 50 | - |
| 1 | 63 | 13 |
| 2 | 70 | 7 |
| 3 | 40 | -30 |
| 4 | 55 | 15 |
| 5 | 65 | 10 |
| 6 | 60 | -5 |
| 7 | 72 | 12 |
| 8 | 79 | 7 |
| 9 | 68 | -11 |
| 10 | 74 | 6 |
Therefore, the output of maxProfit([13,7,-30,15,10,-5,12,7,-11,6]) should be (3, 7, 39) . This is because our maximum profit would be 3939 when we buy the stock at day 4, index of 33, and sell after day 8, index of 77. Then, the total profit is 15+10−5+12+7=3915+10−5+12+7=39
In python 3
We will try to solve the problem using various techniques:
- Divide-and-Conquer
![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%2Fbd46c511-9440-45b0-b401-03cb614679e5%2Fbob550p_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
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 with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY