Arranging given array to Ascending Order.

import java.util.*;
class DescendingOrdeInArray
{
public static void main(String[] args)
{
int i,j,temp;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the size of array");
int n= sc.nextInt();
int arr[]=new int[n];
System.out.println("Enter the elements of array");
for(i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(arr[i]>arr[j])
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}
System.out.println("Array in ascending order is");
for(i=0;i<n;i++)
{
System.out.print(arr[i] + " ");

}
}
}
        
                            Output : -
        


Comments

Post a Comment

Popular posts from this blog

LCM and GCD/HCF code

 import java.util.Scanner; class Gcd { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Enter two Number"); int a = sc.nextInt(); int b = sc.nextInt(); int qa = a; int qb = b;   System.out.println("Gcd of " + a + " and " + b + " is ");   while(a%b!=0)      {       int rem= a%b;           a=b; b=rem;                }        int gcd = b; int lcm = (qa*qb)/gcd;      System.out.println(gcd);   System.out.println(lcm);  } } Input :-a=2,b=3 gcd = 1 lcm = 6
Read more

Binary Search using Java

 import java.util.Scanner; class BinarySearch { public static void main(String[] args) { int low,high,mid,i,n;  Scanner sc = new Scanner(System.in); System.out.println("Enter the size of array"); n= sc.nextInt(); int [] arr = new int[n]; System.out.println("Enter the elements"); for(i=0;i<n;i++) { arr[i]=sc.nextInt(); } System.out.println("Enter the elements you want to search"); int e = sc.nextInt(); low=0; high=n-1; while(low<=high) { mid=(low+high)/2; if(arr[mid]==e) { System.out.println("Element found at index " + mid  ); break; } else if(arr[mid]<e) { low = mid+1; } else { high = mid-1; } } if(low>high) System.out.println( e + " Not found "); } } Input :- Enter the size of array : - 5 Enter the elements :- 1,2,3,4,5 Enter the elements you want to search : - 5 Output :- Element found at index  :- 4 Enter the size of array : - 5
Read more

Calculator Using Switch Case in Java

  import java.util.*; class CalculatorUsingSwitchCase { public static void main(String[] args) { char operator; double result; Scanner input = new Scanner(System.in); System.out.println("Enter First Number"); double n1 = input.nextDouble(); System.out.println("Enter Second Number"); double n2 = input.nextDouble(); System.out.println("Choose an Opeartor : + , - , * , / , or %"); operator = input.next().charAt(0);  switch (operator) { case '+' : result = n1 + n2; System.out.println("Addition of " +n1+ " and " + n2+ " is "  + result); break; case '-' : result = n1-n2; System.out.println("Subraction of " +n1+ " and " + n2+ " is "  + result); break; case '*' : result = n1*n2; System.out.println("Multiplication of " +n1+ " and " + n2+ " is "  + result); break; case '/' : result = n1
Read more