CodeWithYuvi

  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:-

 import java.util.*; class WordPalindorome { public static void main(String[] args) { int div=0 ,n; Scanner sc = new Scanner(System.in); System.out.println(" enter the word"); String s = sc.nextLine(); char str[]=s.toCharArray(); n= str.length; for(int i =0;i<n;i++) { if(str[i]!=str[n-i-1]) { div++; break; } } if(div == 0) { System.out.println("hai"); } else { System.out.println(" nhi hai"); } } }

  import java.util.*; class UpperCaseToLowerCase { public static void main(String[] args) { Scanner sc =new Scanner(System.in); System.out.println("Enter any Word in lowercase"); String str = sc.nextLine(); char s[]=str.toCharArray(); for(int i=0;i<s.length;i++) { if(s[i]>='a' && s[i]<='b') { s[i]=(char)((int)s[i]-32);//60 -90 A-Z   //97-122 a-z // differnce bwtn upper case and lowecase is 122-90=32  } } System.out.println("Word in Uppercase is"); for(int i=0;i<s.length;i++) { System.out.print(s[i]); } } } Input :- Enter the word in lowercase  hello Output :- word in Uppercase is  HELLO

import java.util.*; class UpperCaseToLowerCase { public static void main(String[] args) { Scanner sc =new Scanner(System.in); System.out.println("Enter any Word in uppercase"); String str = sc.nextLine(); char s[]=str.toCharArray(); for(int i=0;i<s.length;i++) { if(s[i]>='A' && s[i]<='Z') { s[i]=(char)((int)s[i]+32);//60 -90 A-Z   //97-122 a-z // differnce bwtn upper case and lowecase is 122-90=32  } } System.out.println("Word in lowercase is"); for(int i=0;i<s.length;i++) { System.out.print(s[i]); } } } Input :-  Enter any Word in uppercase :- HELLO WORLD Output :- Word in lowercase is :-hello world

 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

  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