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
Use a single temp element.
int array[SIZE]; int temp; for (int i = 0; i < SIZE/2; i++) { temp = array[i]; array[i] = array[SIZE-1 - i]; array[SIZE-1 - i] = temp; }