Question

Java Program:

Write an algorithm (steps) using pseudocode (no java code required) explaining steps for a method which will reverse an integer array (Integer[]) without using any other data structure. The method should return the reversed integer array.

E.g. If input array Integer[] integers = [1,2,3,4,5,6] should return [6,5,4,3,2,1]

Answer 1

algorithm:
-----------
int[] reverse(int[] input)
    int reversedArray[input.length]
    for(i = 0;i<input.length;i++)
        reversedArray[input.length-i-1] = input[i];
    end
    return reversedArray
end

Note: Please comment below if you have any doubts