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

LPS(Longest Prefix Which Is Also Suffix) Array Generation Using Java

import java.util.* ; //Longest Prefix Which Is Also Suffix Which Is Used To Found a Pattern Through Avoid Repeated Characters in Given String. We Will Discuss KMP ALGORITHM TO Find A Pattern In Given String Latter. class lbs{ public static void main( String [] args){ Scanner in= new Scanner(System.in); //Get Input From User String s=in.nextLine(); //Convert String Into Char Array char [] ch=s.toCharArray(); int n=s.length(); int [] lbsArr= new int [n]; int j= 0 ,i= 1 ; lbsArr[ 0 ]= 0 ; //LPS ARRAY ALGORITHM /* i=1; j=0; string s="aaab" while i<n if s[i]==s[j]: lpsArr[i]=j; j=j+1 i=i+1 else: if j==0: lbsArr[j]=0 i=i+1 else: ...

Stack is Linear Data Structure- Basic DSA In Java Programming

/* Stack Is a Linear Data Structure.FIFO(First In First Out) or LIFO(Last In First Out). [ Elements ] [ Elements ] [ Elements ] [ Elements ] */ import java.util.*; class stack{ public static void main( String [] args){ Stack < Integer > s= new Stack < Integer >(); //Push Element To Stack s.push( 10 ); s.push( 5 ); s.push( 2 ); s.push( 1 ); System.out.println(s); /* After Push The Stack Like [ 1 ] <---Push And Pop In Top Of The Statck [ 2 ] [ 5 ] [ 10] */ //Pop Element From Statck s.pop(); System.out.println(s); /* After Pop From Stack [ 1 ]--> Pop From Top Of The Stack [ 5 ] [ 10] */ System.out.println(s.peek()); /* s.peek(); Shows Top Of The Stack */ /* s.empty() returns boolean V...

if control statement - Basic Programming Concepts With psudo Code

if( ) is a control statement. it based on some condition. if the condition can true the block of statements can execute other wise skip the statements. syntax if([condition]) { //statement; } example1, #include<stdio.h> #include<conio.h> main() int num=1; { if(num==1) { printf("\n its true"); } } from the above program we can declare the variable named as num and assign the value as 1. then, check the value 1 equal value of num through if statement.the statement can true.so, the block of statements can executed. example2, #include<stdio.h> #include<conio.h> main() int num=5; { if(num==1) { printf("\n its true"); } } suppose the value of num is 5.the block of if statement can skip to execution.

javacpp

Search This Blog