Why Buy and Sell Stocks All Variants in DSA C?

The Big Idea

Discover how simple rules can turn confusing stock prices into clear profit opportunities!

The Scenario

Imagine you want to make money by buying and selling stocks. You try to track prices on paper and decide when to buy or sell manually.

You write down prices every day and try to guess the best days to buy low and sell high.

The Problem

This manual way is slow and confusing. You might miss the best days or sell too early.

It is hard to remember all prices and compare them quickly, especially if prices change every minute.

The Solution

Using algorithms to buy and sell stocks helps you find the best days to buy and sell automatically.

These algorithms check all prices fast and tell you when to act to get the most profit.

Before vs After

✗ Before

int maxProfit(int prices[], int n) {
    int max_profit = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (prices[j] > prices[i]) {
                int profit = prices[j] - prices[i];
                if (profit > max_profit) max_profit = profit;
            }
        }
    }
    return max_profit;
}

✓ After

int maxProfit(int prices[], int n) {
    int min_price = prices[0];
    int max_profit = 0;
    for (int i = 1; i < n; i++) {
        if (prices[i] < min_price) min_price = prices[i];
        else if (prices[i] - min_price > max_profit) max_profit = prices[i] - min_price;
    }
    return max_profit;
}

What It Enables

It enables you to quickly find the best buy and sell points to maximize profit without guessing.

Real Life Example

Stock traders use these algorithms to decide when to buy or sell shares automatically, saving time and increasing earnings.

Key Takeaways

Manual tracking of stock prices is slow and error-prone.

Algorithms find the best buy/sell days quickly and accurately.

This helps maximize profit with less effort and mistakes.