C program for Best time to buy and Sell stock
Best time to buy and Sell stock in C
Here, in this page we will discuss the program to find the best time to buy and sell stock in C We are given with an array represents the cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling in those days.
Example :
Input: Prices[ ] = [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.
Algorithm :
- Take the size of the array from the user and store it in variable say n.
- Now, declare an array of size n and takes n integer value from the user and store them in array.
- Create an array named max_sp of size equals size of price array and a variable max and initialize it as the minimum value.
- Start from the last index in price array.
- If prices[i] is greater than max
- Update max as prices[i] and make max_sp[i] as minimum value
- Else if price[i] is not greater than max
- Update max_sp[i] = max.
- If prices[i] is greater than max
- After the pre computation, we follow the naive approach and replace the inner nested loop by using the max_sp array that we just created.
- Print value of max.
Code in C
#include <stdio.h>
#include<limits.h>
int maxProfit(int *prices, int n) {
int max_sp[n];
int maximum = INT_MIN;
// Construct the maxSP array
for (int i = n - 1; i >= 0; i--) {
if (prices[i] > maximum) {
maximum = prices[i];
max_sp[i] = INT_MIN;
}
else {
max_sp[i] = maximum;
}
}
int profit = 0;
for (int i = 0; i < n; i++) {
if (max_sp[i] != INT_MIN && profit <(max_sp[i] - prices[i])) {
profit = max_sp[i] - prices[i];
}
}
// Return profit
return profit;
}
int main() {
int n;
scanf("%d", &n);
int prices[n];
for(int i=0; i<n; i++)
scanf("%d", &prices[i]);
// Calculating the max profit
int ans = maxProfit(prices, n);
// Print the answer
printf("%d", ans);
return 0;
}
Input :
6
7 1 5 3 6 4
Output :
5
Prime Course Trailer
Related Banners
Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription
Login/Signup to comment
#include
int main(){
int i,j,n,s,max=0;
int price[100];
scanf(“%d”,&n);
for(i=0;i<n;i++){
scanf("%d",&price[i]);
}
for(i=0;i<n;i++){
for(j=i+1;jmax){
max=s;
}
}
}
printf(“%d”,max);
}
Kindly join our Discord for any technical query.
#program in python
def buysell(arr):
profit=0
for i in range(len(arr)-1):
for j in range(i+1,len(arr)):
if (arr[j]-arr[i])>profit:
profit=(arr[j]-arr[i])
return profit
arr=[7,1,5,3,6,4]
print(buysell(arr))
Kindly join our Discord Channel for technical queries.