Javascript Program For Stock Buy Sell To Maximize Profit

// Javascript program to implement
// the above approach

// Function to return the maximum profit
// that can be made after buying and
// selling the given stocks
function maxProfit(price, start, end) {
    // If the stocks can't be bought
    if (end <= start)
        return 0;

    // Initialise the profit
    let profit = 0;

    // The day at which the stock
    // must be bought
    for (let i = start; i < end; i++) {
        // The day at which the
        // stock must be sold
        for (let j = i + 1; j <= end; j++) {
            // If buying the stock at ith day and
            // selling it at jth day is profitable
            if (price[j] > price[i]) {
                // Update the current profit
                let curr_profit = price[j] - price[i] +
                    maxProfit(price,
                        start, i - 1) +
                    maxProfit(price,
                        j + 1, end);

                // Update the maximum profit 
                // so far
                profit = Math.max(profit,
                    curr_profit);
            }
        }
    }
    return profit;
}

// Driver code
let price = [100, 180, 260, 310,
    40, 535, 695];
let n = price.length;
console.log(maxProfit(
    price, 0, n - 1));

// JavaScript program to implement 
// the above approach

// This function finds the buy sell
// schedule for maximum profit
function stockBuySell(price, n) {
    // Prices must be given for at 
    // least two days
    if (n == 1)
        return;

    // Traverse through given price array
    let i = 0;
    while (i < n - 1) {
        // Find Local Minima
        // Note that the limit is (n-2) as we 
        // are comparing present element to 
        // the next element
        while ((i < n - 1) &&
            (price[i + 1] <= price[i]))
            i++;

        // If we reached the end, break
        // as no further solution possible
        if (i == n - 1)
            break;

        // Store the index of minima
        let buy = i++;

        // Find Local Maxima
        // Note that the limit is (n-1) as we 
        // are comparing to previous element
        while ((i < n) &&
            (price[i] >= price[i - 1]))
            i++;

        // Store the index of maxima
        let sell = i - 1;

        console.log(`Buy on day: ${buy}
        Sell on day: ${sell}`);
    }
}

// Driver code
// Stock prices on consecutive days
let price = [100, 180, 260,
    310, 40, 535, 695];
let n = price.length;

// Function call
stockBuySell(price, n);

// This code is contributed by Potta Lokesh