FROM USER INPUT ARRANGE IT

Arrange 122,22,43,56,10 ---> 10,22,43,56,122 FROM USER INPUT

package com.cnc;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        int count, temp;

        //User inputs the array size
        Scanner scan = new Scanner(System.in);
        System.out.print("Enter number of elements you want in the array: ");
        count = scan.nextInt();

        int num[] = new int[count];
        System.out.println("Enter array elements:");
        for (int i = 0; i < count; i++)
        {
            num[i] = scan.nextInt();
        }
        scan.close();
        for (int i = 0; i < count; i++)
        {
            for (int j = i + 1; j < count; j++) {
                if (num[i] > num[j])
                {
                    temp = num[i];
                    num[i] = num[j];
                    num[j] = temp;
                }
            }
        }
        System.out.print("Array Elements in Ascending Order: ");
        for (int i = 0; i < count - 1; i++)
        {
            System.out.print(num[i] + ", ");
        }
        System.out.print(num[count - 1]);
    }
    }


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