Create divide and conquer algorithm to solve problem

Assignment Help Data Structure & Algorithms
Reference no: EM1367204

1 Suppose we drive a pickup truck from city A to city B. Along the high way, we will go through n apple markets, labeled with 1, 2, ..., n, where you can buy or sell apples. City A and city B also have an apple market each. For convenience, we label city A with 0 and city B with n+1. From a customer point of view, the buying price B[i] and selling price S[i] (dollar per pound) at market i are known. An example with n = 4 is given below.

Now, we will stop at one of the stations to buy apples and then stop at another station to sell apples. Please design an O(n) greedy algorithm to find market i to buy apples, and find market j ? i to sell apples such that the profit will be maximized. We assume that it would be too costly and forbidden to drive backward. In the above example, the best result is to buy apples at market 3 and sell them at market 5 with profit of (7-2 = 5) dollars per pound. It is allowed that i = j which means you buy and sell apples at the same market i.

Also Design a divide and conquer algorithm to solve problem 2. The time complexity of your algorithm must be O(nlgn) or better.

Reference no: EM1367204

Questions Cloud

Find the height from the top : A flower pot falls from the roof and passes in front of a window of height h as it falls to the ground to smash to pieces. If the flower pot takes a time T to pass from top to bottom in front of window. Find the (as-yet-unknown) height H from the ..
Calculate contribution margin of the product : Ann Page Corporation has fixed expenses of $30,000 per year. Variable expenses per unit are $17. Sales price per unit is $30.
Intra-community territoriality : Territoriality of communities within communities often creates division and conflict. What is an example that reflects such intra-community territoriality?
Elucidate how income changes along demand curve : elucidate how income changes along demand curve and why a local builder seeking to maximize income on a small site would be interested in elasticity of demand.
Create divide and conquer algorithm to solve problem : Create a divide and conquer algorithm to solve problem. The time complexity of your algorithm must be O(nlgn) or better.
Breast cancer chemotherapy : For example, do you know any women who have had their breast cancer chemotherapy paid for by Avon? by Mary Kay? through a drug company?
Implication of demand of law : Your are the chief economic advisor to the King of Terra. The king has observed that while the price of energy has increased 20 percent over the past five years, consumers have actually increased their energy consumption by 10 percent over the sam..
Illustrate cost of good x to drive it to equilibrium : Find out QD and QS when cost of good X is $12.00. Is re a surplus or shortage. Illustrate what should happen to cost of Good X to drive it to Equilibrium.
Flexible exchange rate system : Suppose that expectation of reducing housing values cause households to decrease their demand for new houses and the financing that accompanies it.

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Currency conversion development

Currency Conversion Development

  Determining public keys for other party in sending message

Determine correct public keys for other party, and assuming that Eve can intercept any messages.

  Explaining diffie-hellman public-key algorithm

Use the Diffie-Hellman public-key algorithm to exchange secret keys.

  Implement an open hash table

In this programming assignment you will implement an open hash table and compare the performance of four hash functions using various prime table sizes.

  Explaining view of header and footer areas of worksheet

In which view can you see header and footer areas of worksheet?

  Transmitting image using raster scan order

If we were to transmit this image using raster scan order, after 15 seconds how many rows of the image will the user have received?

  Computing time complexity of procedure

What is the time complexity of the procedure? If A[l .. r] = [24, 30, 09, 46, 15, 19, 29, 86,78], what is the output?

  Algorithm to take input m constraints over n variables

For instance, the constraints x1 = x2, x2 = x3, x3 = x4, and x1 6= x4 cannot be satis fied. Give an efficient algorithm that takes as input m constraints over n variables and decides whether the constraints can be satis fied.

  Cloud computing assignment

WSDL service that receives a request for a stock market quote and returns the quote

  Find cost of sorting the relation

Suppose the cost of seek is 5milliseconds, while the disk transfer rate is 40 mgbytes per second. Find the cost of sorting the relation , in seconds, w/bb = 1 & w/ bb= 100.

  Design analgorithm that decides for each node

Design an O(n) algorithm that decides (schedules) for each node at which time slot to start sending data such that the total number of time (slots) is minimized.

  Data structures and algorithm design

Data Structures and Algorithm Design

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd