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

Height Of Tree-Using Java Programming

  class node{ int data; node left; node right; node( int data){ this .data=data; } } class treeHeight{ node root; treeHeight(){ root= null ; } public static void main( String [] args){ treeHeight t=new treeHeight(); t.insert( 15 ); t.insert( 20 ); t.insert( 10 ); t.insert( 5 ); t.insert( 2 ); System.out.println(t.height(t.root)); } public void insert( int data){ root=addNode(root,data); } public node addNode(node root, int data){ if (root== null ){ return new node(data); } else if (root.data<data){ root.right=addNode(root.right,data); } else if (root.data>data){ root.left=addNode(root.left,data); } else { return root; } return root; } /* 15,20,10,5 Regression Is Used To Divide a Hu...