Reverse Array Order

Question

I am trying to reverse the order of an Array in java.
What is the most efficient way to do so in O(n) with the least amount of memory used.
No need to answer with co

Answer 1

you can do it without needing a temp array

• loop from the beginning (or end doesn't matter) to the middle of the array
• swap element with element at (last element - index) (so 0 and size - 1, 1 and size - 2 etc)
• you'll do something like this to swap:

    temp = a[i];
    a[i] = a[end-i];
    a[end-i] = temp;

• repeat