Skip to content

Commit

Permalink
Merge pull request #1442 from Dipanita45/DipanitaB
Browse files Browse the repository at this point in the history
Made the changes and added c file #503
  • Loading branch information
pankaj-bind authored Oct 30, 2024
2 parents 9a8fb9c + b48ca72 commit 3eb519f
Showing 1 changed file with 33 additions and 0 deletions.
33 changes: 33 additions & 0 deletions Optimization Algorithms/Best Time To Buy and Sell/Programbest.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
#include <stdio.h>

int maxProfit(int* prices, int pricesSize) {
if (pricesSize <= 1) return 0; // No profit can be made

int minPrice = prices[0]; // Initialize minPrice to the first price
int maxProfit = 0; // Initialize maxProfit to 0

for (int i = 1; i < pricesSize; i++) {
// Update minPrice if the current price is lower
if (prices[i] < minPrice) {
minPrice = prices[i];
} else {
// Calculate profit if we sell at the current price
int profit = prices[i] - minPrice;
if (profit > maxProfit) {
maxProfit = profit; // Update maxProfit if the current profit is higher
}
}
}

return maxProfit; // Return the maximum profit found
}

int main() {
int prices[] = {7, 1, 5, 3, 6, 4}; // Example prices
int size = sizeof(prices) / sizeof(prices[0]);

int result = maxProfit(prices, size);
printf("The maximum profit is: %d\n", result);

return 0;
}

0 comments on commit 3eb519f

Please sign in to comment.