Question

algorithm to find the maximum difference of j - i such that a[j] > a[i], for a given an array of 'n' elements.

Answer 1

Input: {34, 8, 10, 3, 2, 80, 30, 33, 1}

Output: 6 (j = 7, i = 1)

Input: {9, 2, 3, 4, 5, 6, 7, 8, 18, 0}

Output: 8 ( j = 8, i = 0)

Input: {1, 2, 3, 4, 5, 6}

Output: 5 (j = 5, i = 0)

Input: {6, 5, 4, 3, 2, 1}

Output: -1

PLEASE MAKE ME AS A BRAINLIST ANSWER