Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
In python 3 Simple Iterative As we in general, try to solve the problem

In python 3 Simple Iterative As we in general, try to solve the problem

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

In python 3

Simple Iterative

As we in general, try to solve the problem first; we start with a brute force, simple, algorithm: design it below

 

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])
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])
# 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,e) # Try your algorithm maxProfitBrute([13,7,-30,15,10, -5,12,7, -11,6])
Transcribed Image Text:# 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,e) # Try your algorithm maxProfitBrute([13,7,-30,15,10, -5,12,7, -11,6])
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Public key encryption
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS