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 sel 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 Input: changes : array listing changes in the prices, where indices represent days; it has at least two values Output i : index of the change before which we buy j: index of the change before which we sell maxProfit : 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 70 3 40 4 55 65 6 60 7 72 79 9. 68 74 2. 10
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 sel 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 Input: changes : array listing changes in the prices, where indices represent days; it has at least two values Output i : index of the change before which we buy j: index of the change before which we sell maxProfit : 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 70 3 40 4 55 65 6 60 7 72 79 9. 68 74 2. 10
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 algorithm that answers:
what is the perfect moment to buy and when to sell to maximize your profit?
Assume you must buy
Input:
changes : array listing changes in the prices, where indices represent days; it has at least two values
Output:
i : index of the change before which we buy
j: index of the change before which we sell
maxProfit : the profit of this interval
Example:
Assume the below table contains the prices of a particular stock over days
prices changes
Day Value
50
1
63
13
70
7
3
40
-30
55
15
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 39
when we buy the stock at day 4, index of 3, and sell after day 8, index of 7. Then, the total profit is 15+ 10 – 5+ 12 +7 = 39
We will try to solve the problem using various techniques:
Brute-Force
Divide-and-Conquer](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3dfe85b1-e5f0-4a73-ab4f-8ab481027dba%2F39fae564-c78a-4927-8f81-8fb1728474d5%2Ff2dq2yc_processed.png&w=3840&q=75)
Transcribed Image Text: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
Input:
changes : array listing changes in the prices, where indices represent days; it has at least two values
Output:
i : index of the change before which we buy
j: index of the change before which we sell
maxProfit : the profit of this interval
Example:
Assume the below table contains the prices of a particular stock over days
prices changes
Day Value
50
1
63
13
70
7
3
40
-30
55
15
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 39
when we buy the stock at day 4, index of 3, and sell after day 8, index of 7. Then, the total profit is 15+ 10 – 5+ 12 +7 = 39
We will try to solve the problem using various techniques:
Brute-Force
Divide-and-Conquer
![Simple Iterative
As we in general, try to solve the problem first; we start with a brute force, simple, algorithm: design it below
In [ ]: # 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
II II
# return the values
return (0,0,0)
In [ ]: # Try your algorithm
maxProfitBrute([13,7,-30,15,10,-5,12,7,-11,6])](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3dfe85b1-e5f0-4a73-ab4f-8ab481027dba%2F39fae564-c78a-4927-8f81-8fb1728474d5%2Ffc3mqu_processed.png&w=3840&q=75)
Transcribed Image Text:Simple Iterative
As we in general, try to solve the problem first; we start with a brute force, simple, algorithm: design it below
In [ ]: # 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
II II
# return the values
return (0,0,0)
In [ ]: # Try your algorithm
maxProfitBrute([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 3 steps with 1 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