How To Contrary Array Inwards House Inwards Java? Solution Amongst Explanation

Reversing an array sounds pretty easy, isn't it? It does sounds similar that, because all you lot demand to do is create an array of same size, iterate through master array from terminate to start too populate your novel array. Boom!!, you lot guide keep got an array which has elements inward opposite companionship of master array, but work is you lot guide keep used too additional array here, which makes infinite complexity of your solution O(n). You cannot purpose this solution if array is large e.g. an array of x 1000000 orders too you lot don't guide keep enough heap space available. Can nosotros larn inward better? Can nosotros opposite array inward Java without using an additional buffer? Even If you lot come across this query inward your programming project interview, you lot volition last sure enough asked to reverse array inward place, without using an additional buffer as before solution takes lot of space. So right away your project is to write a Java computer program to opposite an array inward place. For the sake of this problem, you lot tin assume that its an integer array (during interview, you lot should inquire these query to your interviewer, because squall for correct query to fill upwards the gap inward requirement is a trait of practiced programmer too highly appreciated on both telephonic too face-to-face interviews). Key signal to sympathise hither is that you lot demand to opposite the same array, you lot cannot purpose around other array but i or 2 variable is fine. You are likewise non allowed to purpose whatever opened upwards source library or Java API which tin opposite the array straight e.g. whatever method from java.util.Arrays aeroplane except Arrays.toString()to print arrays inward Java. So right away the requirement is clear, what approach comes inward your mind? how do you lot solve this problem?

Java Program to Reverse Array In Place

The starting fourth dimension affair which comes inward my heed is to loop through array too swap the elements of array e.g. swap starting fourth dimension chemical component amongst terminal element, swap minute chemical component amongst minute terminal chemical component until you lot attain the middle of the array. This way, all elements of array volition last reversed without using whatever additional buffer. Key affair to boot the bucket along inward heed inward this algorithm is that you lot solely demand to iterate till middle element, if you lot larn beyond that too hence you lot terminate upwards swapping elements twice too consequence inward same array. Some of you lot volition last puzzled, what is length of array is even? In that illustration at that topographic point volition last 2 middle chemical component too nosotros demand to swap them, that's why your loop status should last index <= middle too non index < middle. Here middle index is zilch but length/2. Remember, nosotros are using segmentation operator, which agency if length is 8 too hence it volition provide iv too when length is seven it volition provide 3. So inward illustration of fifty-fifty length, the middle chemical component volition last swapped twice, but inward illustration of strange length at that topographic point is merely i middle chemical component too it volition non last swapped.

It's been said fourth dimension too over again that a motion-picture exhibit is worth a M give-and-take too truthful to the point, this paradigm explains the algorithm nosotros used to opposite array inward house quite well. You tin reckon that how elements of arrays are swapped seat amongst each other too middle chemical component rest unchanged, amongst merely 2 swapping nosotros guide keep reversed an array of 5 elements.

Here is our sample Java computer program to opposite array inward place, solution is elementary too slow to follow, but don't forget to expect my JUnit tests to sympathise it fleck more.

import java.util.Arrays;  /**  * Java Program to demonstrate how to opposite an array inward place.  */ public class ArrayReversalDemo {      public static void main(String[] args) {         int[] numbers = {1, 2, 3, 4, 5, 6, 7};         reverse(numbers);     }      /**      * opposite the given array inward house       * @param input      */     public static void reverse(int[] input) {         System.out.println("original array : " + Arrays.toString(input));                  // treatment null, empty too i chemical component array         if(input == null || input.length <= 1){             return;         }                         for (int i = 0; i < input.length / 2; i++) {             int temp = input[i]; // swap numbers             input[i] = input[input.length - 1 - i];             input[input.length - 1 - i] = temp;         }          System.out.println("reversed array : " + Arrays.toString(input));     }           }  Output master array : [1, 2, 3, 4, 5, 6, 7] reversed array : [7, 6, 5, 4, 3, 2, 1] master array : [] master array : null master array : [1, 2, 3, 4, 5, 6] reversed array : [6, 5, 4, 3, 2, 1] master array : [1]

You tin reckon inward output hither that input array is reversed properly too inward illustration of null, empty too array amongst merely i element, same array is returned.

JUnit tests

Here is my suite of JUnit tests for our reverse(int[] input)  method. I guide keep made certain to examination our solution tin handgrip null, empty array, an array amongst merely i element, too array amongst fifty-fifty or strange position out of elements. You tin fifty-fifty examination drive this problem. Writing Unit examination is a practiced practice too during Interview you lot must write JUnit examination fifty-fifty if Interview has non asked for it. This shows that you lot are a professional person software developer too you lot assist for your trade.

import static org.junit.Assert.assertArrayEquals;  import org.junit.Test;  public class ArrayReversalDemoTest {          @Test     public void testReverseWithEvenLengthOfArray(){         int[] numbers = {1, 2, 3, 4, 5, 6};         HelloWorld.reverse(numbers);         assertArrayEquals(new int[]{6, 5, 4, 3, 2, 1}, numbers);     }          @Test     public void testReverseWithOddLengthOfArray(){         int[] numbers = {1, 2, 3, 4, 5, 6, 7};         HelloWorld.reverse(numbers);         assertArrayEquals(new int[]{7, 6, 5, 4, 3, 2, 1}, numbers);     }          @Test     public void testReverseWithEmptyArray(){         int[] numbers = {};         HelloWorld.reverse(numbers);         assertArrayEquals(new int[]{}, numbers);     }          @Test     public void testReverseWithNullArray(){         int[] numbers = null;         HelloWorld.reverse(numbers);         assertArrayEquals(null, numbers);     }          @Test     public void testReverseWithJustOneElementArray(){         int[] numbers = {1};         HelloWorld.reverse(numbers);         assertArrayEquals(new int[]{1}, numbers);     }     }

too hither is the output of running our unit of measurement tests, they all pass.

That's all near how to opposite array inward house inward Java. Time complexity of this method is O(n/2) or O(n) because it solely iterate through one-half of the array, but its inward O(n) because response fourth dimension increases inward same companionship every bit input increases. As a task, tin you lot notice a faster solution of this problem?


Further Learning
Data Structures too Algorithms: Deep Dive Using Java
solution)

How to notice prime number factors of an integer inward Java? (solution)

How to banking enterprise stand upwards for if LinkedList contains whatever bike inward Java? (solution)

Write a Program take duplicates from array without using Collection API? (program)

How to opposite String inward Java without using API methods? (Solution)

Write a method to banking enterprise stand upwards for if 2 String are Anagram of each other? (method)

Write a business office to notice middle chemical component of linked listing inward i pass? (solution)

How to solve Producer Consumer Problem inward Java. (solution)

Write a computer program to notice starting fourth dimension non repeated characters from String inward Java? (program)

How to banking enterprise stand upwards for if a position out is binary inward Java? (answer)

Write a Program to Check if a position out is Power of Two or not? (program)

Write a computer program to banking enterprise stand upwards for if a position out is Prime or not? (solution)

Write a method to count occurrences of  a grapheme inward String? (Solution)

How to notice Fibonacci sequence upto a given Number? (solution)

How to banking enterprise stand upwards for if a position out is Armstrong position out or not? (solution)

Write a method to take duplicates from ArrayList inward Java? (Solution)

Write a computer program to banking enterprise stand upwards for if a position out is Palindrome or not? (program)

Write a computer program to banking enterprise stand upwards for if Array contains duplicate position out or not? (Solution)

How to calculate Sum of Digits of a position out inward Java? (Solution)

How to forbid Deadlock inward Java? (solution)

How to notice largest prime number cistron of a position out inward Java? (solution)

How to calculate factorial using recursion inward Java? (algorithm)

How to declare too initialize 2 dimensional array inward Java? (solution)

Write a computer program to notice missing position out inward a sorted array? (algorithm)

How to search chemical component inward array inward Java? (solution)

10 Points near Array inward Java? (must know facts)

How to notice top 2 maximum on integer array inward Java? (solution)

How to form array using bubble form algorithm? (algorithm)

Thanks for reading this article hence far. If you lot similar this article too hence delight part amongst your friends too colleagues. If you lot guide keep whatever query or dubiousness too hence delight permit us know too I'll endeavor to notice an respond for you.