Skip to main content

Array Reverse Using Java


In this article we are discuss about Basic Problem in Programming. How To Reverse a Array Elements.

Reverse a given array elements. For example1,

[1,2,3,4,5]

Output

[5,4,3,2,1]

example2,

Input

[3,5,1,2,4]

Output

[4,2,1,5,3]



1) With Extra Space (Copy Arrar) 

We can simple make a same size of array and copy from given array elements to new array variable.

Its takes o(n) Time Complexity. And more Space To Run Programme.

class arrayReverse{


public static void main(String[] args){
int[] arr={1,2,3,4,5};
int n=arr.length;
int[] brr=new int[n];
for(int i=0;i<n;i++){
brr[i]=arr[n-i-1];
}

for(int j=0;j<n;j++){
System.out.println(brr[j]);
}
}
}


2)With Out Extra Space.

We can Swap The Array Element One By One. Like First Element And Last. Second Element And Second Last Until Reach Middle Element.

class arrayReverseWithoutExtraSpace{

public static void main(String[] args){
int[] arr={1,2,3,4,5,6};
int n=arr.length;
int i=0;
int j=n-1;
while(i<j){
int temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
i+=1;
j-=1;
}

for(int k=0;k<n;k++){
System.out.println(arr[k]);
}
}
}

Comments

Popular posts from this blog

Class is a collection of similar objects. Which have common properties

Class is a collection of similar objects. Which have common properties. Syntax class class_name {        //member functions and variables. } How to create a objects for class class_name c=new class_name; We can access the member variable and member methods using dot operator. c.member_function(); Eg : class bike { void fun() { System.out.println("member method"); } public static void main(String[] args) { bike B=new bike(); B.fun(); } } output member method

Linked List - Data Structure Basic With Example Java

//linked list /*     Linked List is a Linear Data Structure.      Drawback of Array Is continues Block Of Memory. Linked Is Used To Allocate the Different Memory Location. Each node Contains Data And Pointer. Header Is Used To Denote The First Node Of Linked List. Tail Is Used To Denote the Last Node of The Linked List. 1.Singly Linked List Each Node as Data And pointer To The Next Node. [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]; 2.doubly Linked List Each Node as Data And pointer To The Next Node and prev Node. [ data(header) | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | null]; 3.Circle Linked List [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]-->header */ class...