solve with ou build

Question

A person is trading his money in the stock exchange market. Assume that the daily price of a specific market along a certain period of time is given as follows: Price [200, 500, 800, 100, 300, 50) all in Dollar. This means that the price of the stock in the first day is 200$ and the day after which is mean the second day the price is going up to be $500 and so on until the end of the week or the list you are given. You are allowed to buy and sell the stock only once, which means that if you buy it on the first day then you will pay 200$ then if you decided to sell it on the third day then you will get $800 the your profit will be $600. Another example: prices = {300, 450, 720, 90, 30, 50, 900, 500, 70); Output: Buying date: day 5, at the price of $30 selling date: day 7, at the price of $900 Maximum Profit: $870 1. You are requested to develop an algorithm to maximize the profit in single buy and sell. 2. Build your algorithm by using OUBUILD 3. Provide two screenshots with different outputs.

Answer 1

/*******************************

SORRY

*************************/

using namespace std;

#include <iostream>

#include <stdlib.h>

typedef struct _TPriceRec

{

int buyDayNum;

int sellDayNum;

int netResult;

} * TPriceRec;

#define PRICE_REC_SIZE (sizeof(struct _TPriceRec))

int ComparePriceRec( const void * rec1, const void * rec2)

{

TPriceRec priceRec1 = (TPriceRec)rec1;

TPriceRec priceRec2 = (TPriceRec)rec2;

return (priceRec1->netResult - priceRec2->netResult);

}

Go()

{

int N=15;

int prices[] ={ 200, 500, 800, 100, 300, 50, 300, 450, 720, 90, 30, 50, 900, 500, 70};

int n = N*(N+1)/2;

TPriceRec priceRecs = (TPriceRec) malloc(sizeof(struct _TPriceRec)*n);

int iIndexPos=0;

for (int iLoop=0; iLoop<N; iLoop++)

{

for (int jLoop=iLoop+1; jLoop<N; jLoop++)

{

struct _TPriceRec curPriceRec;

curPriceRec.buyDayNum=iLoop;

curPriceRec.sellDayNum = jLoop;

curPriceRec.netResult = prices[jLoop]-prices[iLoop];

priceRecs[iIndexPos++] = curPriceRec;

}

}

qsort(priceRecs,n,PRICE_REC_SIZE,ComparePriceRec);

//Buy on day #10, sell on day #12, max profit = 870

cout << " Buy on day # " << priceRecs[n-1].buyDayNum << endl;

cout << " Sell on day # " << priceRecs[n-1].sellDayNum << endl;

cout << " max profit = " << priceRecs[n-1].netResult << endl;

}