techiedelight.com
Find a sorted triplet in the given array - Techie Delight
Given an array A[] of integers, efficiently find a sorted triplet such that A[i] < A[j] < A[k] and 0