We need to find out the maximum difference (which will be the maximum profit) between two numbers in the given array. Also, the second number (selling price) must be larger than the first one (buying price).
In formal terms, we need to find , for every and such that .
Approach 1: Brute Force
Time complexity : . Loop runs times.
Space complexity : . Only two variables - and are used.
Approach 2: One Pass
Say the given array is:
[7, 1, 5, 3, 6, 4]
If we plot the numbers of the given array on a graph, we get:
The points of interest are the peaks and valleys in the given graph. We need to find the largest peak following the smallest valley. We can maintain two variables - minprice and maxprofit corresponding to the smallest valley and maximum profit (maximum difference between selling price and minprice) obtained so far respectively.
Time complexity : . Only a single pass is needed.
Space complexity : . Only two variables are used.