REVERSE ARRAY 

package com.cnc;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("HOW MANY ELEMENT YOU WANT?");
        int n = sc.nextInt();
        int[] element = new int[n];
        for (int i = 0; i < n; i++) {
            System.out.println("ENTER ARRAY ELEMENT " + (i + 1));
            element[i] = sc.nextInt();
        }
        System.out.println("ORIGINAL ELEMENT ");
        for (int i = 0; i < n; i++) {
            System.out.print(element[i] + " ");
        }

        System.out.println("\n REVERSED ELEMENT ");
        for (int i = n-1; i >=0; i--) {
            System.out.print(element[i] + " ");
        }

    }

package com.cnc;
public class Main {

    public static void main(String[] args) {
    int [ ] array = {0,1,2,3,4,5};
    for(int i = 0;i< array.length;i++){
        System.out.print(array[i]+" ");
    }
        System.out.println(" ");
    for(int i = array.length-1; i>=0;i--){
        System.out.print(array[i]+" ");
    }
    }
}

Popular posts from this blog

NUMBER PALINDROME CHALLENGE

  package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( isPalindrome ( 101 )); } public static boolean isPalindrome ( int number) { int reverse = 0 ; int temporaryNumber =number; while (number!= 0 ){ reverse = reverse* 10 + number% 10 ; number = number/ 10 ; } if (reverse== temporaryNumber ) return true ; else return false ; } }
Read more

ENCAPSULATION CHALLENGE

package com.cnc ; public class Main { public static void main ( String [] args) { Printer printer = new Printer( 50 , true ); System . out .println( "Initial Page count is " + printer .getNumberOfPages()); int pagesPrinted = printer .getNumberOfPages( 4 ); } } package com.cnc ; public class Printer { private int tonerLevel = 100 ; private int numberOfPages ; private boolean isDuplex ; public Printer ( int tonerLevel, boolean isDuplex) { if (tonerLevel>=- 1 && tonerLevel<= 100 ) { this . tonerLevel = tonerLevel; } else { this . tonerLevel =- 1 ; } this . isDuplex = isDuplex; this . numberOfPages = 0 ; } public int addToner ( int tonerAmount){ if (tonerAmount> 0 && tonerAmount<= 100 ){ if ( this . tonerLevel +tonerAmount > 100 ){ return - 1 ; } this . tonerLevel += tonerAmount
Read more

LARGEST PRIME FACTOR OF A NUMBER

package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( getLargestPrime ( 20 )); System . out .println( getLargestPrime ( 7 )); } public static int getLargestPrime ( int number){ int i,stored=number; if (number<= 0 ) return - 1 ; else if ( isPrime (number)){ number=stored; } else { for ( i = 2 ; i < number; i++){ if (number%i== 0 ){ stored=i; } } } return stored; } public static boolean isPrime ( int n){ for ( int j = 2 ; j <n; j ++){ if (n% j == 0 ) return false ; else return true ; } return false ; } } ☑ Here i created a new method isTrue. if the number is prime then the number will return the same as output. but if it is not a prime then it will return the largest number excluding itself.
Read more