Use pseudocode algorithm please

(30%) write a pseudocode algorithm that, given n > 1 and a sequence of n values x, x reverses the order of the values read, in the same array where they were read; this is to say, the values read into x1 and xn must be exchanged, those read into x2 and X1 must also be exchanged, and so on. Notice that when n 1 the array is already inverted. Finally, print Xu xn (the output must show the same elements read, but in the reverse order)