algorithms.tutorialhorizon.com
Maximum difference between two elements where larger element appears after the smaller element | Algorithms
Given an array A[], write an algorithm to find Maximum difference between two elements where larger element appears after the smaller element or in other words find A[i] and A[j] such that A[j]-A[i] is maximum where j > i.