Question

Use pseudocode to describe an algorithm that displays the last occurrence of each element in an input sequence a_0,a_1,…,a_n. In other words, if an element appears more than once in the sequence, only the last occurrence is displayed.

Example:

4, -5, 3, 2, 3, -1, 4, 3  displays -5, 2, -1, 4, 3

Determine the running time of your algorithm as a function of n (in the worst, best and average case) and then use asymptotic notation to simplify it.