algorithms.tutorialhorizon.com
Find Increasing Triplet Sub-sequence | Algorithms
Given an integer array A[1..n], find an instance of i,j,k where 0 < i < j < k