Algorithm End_to_Beginning Step 1. Set all the values in the array H to 0. Step 2. Starting with H[n-1] and going down to H[0] try to increase the value of H[i] as follows: Step 3. Starting with index i+1 and going up to n-1 (the last index in the array A) repeat Steps 4 and 5: Step 4. See if any element is smaller or equal to A[i] and has its H value also bigger to H[i]. Step 5. If yes, then A[i] can be followed by that element in a sorted subsequence, thus set H[i] to be 1 plus the H value of that element. Step 6. Calculate the largest (maximum) value in array H. By adding 1 to that value we have the length of a longest reversely sorted subsequence. Step 7. Identify a longest subsequence by identifying elements in array A that have decreasing H values, starting with the largest (maximum) value in array H.