Consolidate all in one class called: Algoiava (write a Driver and call/test each
ID: 3717806 • Letter: C
Question
Consolidate all in one class called: Algoiava (write a Driver and call/test each algo) Fahrenheit to Celsius Celsius to Fahrenheit AreaOfCircle Max value in array (int, array) Min value in array (int, array) # of Even #sin array (int, array) # of Odd ms in array (int, array) Palindrome Find char in String First repeating char in String Last repeating char in String First non-repeating char in String DO NOT USE SCANNER 3 test cases per method Count digits in Stringl . Count even numbers in String[) Reverse array Reverse String String split using any delemiter (String, delim) (returns a String[I Bubble sort int[ Bubble sort Stringl Prime numberExplanation / Answer
package com.test;
import java.util.Arrays;
import java.util.HashSet;
public class Algo {
public static void FahrenheitToCelsius(double temp) {
double temp1 = ((temp - 32)*5)/9;
System.out.println("fahrenheit of "+temp+" is "+temp1+" celusis ");
}
public static void CelsiusToFahrenheit(double temp) {
double temp1 = (9.0/5.0)*temp + 32;
System.out.println("celusis of "+temp+" is "+temp1+" fahrenheit");
}
public static void AreaOfCircle(double radius) {
double area = Math.PI * (radius * radius);
System.out.println("Area Of Circle With a radius "+radius+" is "+area);
}
public static void CircumferenceOfCircle(double radius) {
double circumference= Math.PI * 2*radius;
System.out.println("Circumference Of Circle With a radius "+radius+" is "+circumference);
}
public static void MaxArray(int[] array){
int max=0;
System.out.print("Array : ");
for(int i=0;i<array.length;i++){
System.out.print(array[i]+" ");
if(max<array[i]){
max=array[i];
}
}
System.out.println(" Maximum Number is "+max);
}
public static void MinArray(int[] array){
int min = array[0];
System.out.print("Array : ");
for(int i=0;i<array.length;i++){
System.out.print(array[i]+" ");
if(min>array[i]){
min=array[i];
}
}
System.out.println(" Minimum Number is "+min);
}
public static void FindingEvens(int[] array){
int evencount=0;
System.out.print("Array : ");
for(int i=0;i<array.length;i++){
System.out.print(array[i]+" ");
if(array[i]%2==0)
{
evencount++;
}
}
System.out.println(" Total No.of Even is "+evencount);
}
public static void FindingOdds(int[] array){
int oddcount=0;
System.out.print("Array : ");
for(int i=0;i<array.length;i++){
System.out.print(array[i]+" ");
if(array[i]%2!=0)
{
oddcount++;
}
}
System.out.println(" Total No.of Even is "+oddcount);
}
public static boolean isPalRec(String str, int s, int e)
{
if (s == e)
return true;
if ((str.charAt(s)) != (str.charAt(e)))
return false;
if (s < e+1)
return isPalRec(str, s+1, e-1);
return true;
}
public static boolean isPalindrome(String str)
{
int n = str.length();
if (n == 0)
return true;
return isPalRec(str, 0, n-1);
}
public static void checkpalindrome(boolean palindrome, String string) {
if(palindrome){
System.out.println("Given String "+string+" is a Palindrome");
}
else{
System.out.println("Given String "+string+" is not a Palindrome");
}
}
public static void FindChar(String string, String string2) {
int indexOf = -1;
indexOf = string.indexOf(string2);
if(indexOf!=-1){
indexOf++;
System.out.println("Given Char "+string2+" was Found in the given String "+string+" at "+indexOf);
}
else{
System.out.println("Given Char "+string2+" was not Found in the given String "+string);
}
}
public static char FirstRepeating(char str[])
{
HashSet<Character> h = new HashSet<>();
for (int i=0; i<=str.length-1; i++)
{
char c = str[i];
if (h.contains(c))
return c;
else
h.add(c);
}
return '';
}
public static void LastRepeating(String string, String string2) {
}
public static void FirstNonRepeating(String string, String string2) {
}
public static void CountDigits(String str){
int count=0;
for (int i=0; i<str.length(); i++) {
if (Character.isDigit(str.charAt(i))) {
count++;
}
}
System.out.println(str + " has " + count + " digits");
}
public static void CountEvens(String str){
int count=0;
for (int i=0; i<str.length(); i++) {
if (Character.isDigit(str.charAt(i))) {
int y = str.charAt(i) - '0';
if(y%2==0){
count++;
}
}
}
System.out.println(str + " has " + count + " Even digits");
}
public static void revarray(int[] array) {
System.out.print("Given Array : ");
for(int i=0;i<array.length;i++){
System.out.print(array[i]+" ");
}
System.out.println();
System.out.print("Reverse Array : ");
for(int i=array.length-1;i>=0;i--){
System.out.print(array[i]+" ");
}
System.out.println();
}
public static void printrepeating(char firstRepeating, String str) {
if(firstRepeating==''){
System.out.println("First Repeating char was not Found in this String : "+str);
}
else{
System.out.println("First Repeating char : "+firstRepeating+" was Found in this String : "+str);
}
}
public static void revString(String str) {
String reverse = "";
System.out.println("Given String :"+str);
for(int i = str.length() - 1; i >= 0; i--)
{
reverse = reverse + str.charAt(i);
}
System.out.println("Reversed string is:"+reverse);
System.out.println();
}
public static void bubbleSort(int arr[])
{
int n = arr.length;
System.out.println("Given Array :");
for (int i=0; i<n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
for (int i = 0; i < n-1; i++)
for (int j = 0; j < n-i-1; j++)
if (arr[j] > arr[j+1])
{
// swap temp and arr[i]
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
System.out.println("Sorted Array :");
for (int i=0; i<n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
public static void CharacterbubbleSort(String[] arr) {
int n = arr.length;
System.out.println("Given Array :");
for (int i=0; i<n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
Arrays.sort(arr);
System.out.println("Sorted Array :");
for (int i=0; i<n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
public static void isPrime(int n){
int i,m=0,flag=0;
m=n/2;
if(n==0||n==1){
System.out.println("Given Number "+n+" is not prime number");
}else{
for(i=2;i<=m;i++){
if(n%i==0){
System.out.println("Given Number "+n+" is not prime number");
flag=1;
break;
}
}
if(flag==0) { System.out.println("Given Number "+n+" is prime number"); }
}
}
public static void main(String[] args) {
System.out.println("Fahrenheit To Celsius Conversion :");
FahrenheitToCelsius(100);
FahrenheitToCelsius(12.5);
FahrenheitToCelsius(543.9);
System.out.println();
System.out.println("Celsius To Fahrenheit Conversion :");
CelsiusToFahrenheit(120);
CelsiusToFahrenheit(345);
CelsiusToFahrenheit(10.5);
System.out.println();
System.out.println("Area of Circle Using Radius :");
AreaOfCircle(12);
AreaOfCircle(78.9);
AreaOfCircle(90);
System.out.println();
System.out.println("Circumference of Circle Using Radius :");
CircumferenceOfCircle(45);
CircumferenceOfCircle(32);
CircumferenceOfCircle(78);
System.out.println();
System.out.println("Finding the Maximum Number in ArrayList : ");
int[] arr1={1,2,3,4,5,6};
int[] arr2={12,22,31,24,57,63,90};
int[] arr3={900,0,65,32,1234,15678};
MaxArray(arr1);
MaxArray(arr2);
MaxArray(arr3);
System.out.println();
System.out.println("Finding the Minimum Number in ArrayList : ");
MinArray(arr1);
MinArray(arr2);
MinArray(arr3);
System.out.println();
System.out.println("Finding the Even Numbers in ArrayList : ");
FindingEvens(arr1);
FindingEvens(arr2);
FindingEvens(arr3);
System.out.println();
System.out.println("Finding the odd Numbers in ArrayList : ");
FindingOdds(arr1);
FindingOdds(arr2);
FindingOdds(arr3);
System.out.println();
System.out.println("Finding Palindrome :");
boolean palindrome = isPalindrome("nan");
boolean palindrome2 = isPalindrome("ban");
boolean palindrome3 = isPalindrome("geeg");
checkpalindrome(palindrome,"nan");
checkpalindrome(palindrome2,"tan");
checkpalindrome(palindrome3,"geeg");
System.out.println();
System.out.println("Finding Char in a String :");
FindChar("kranthi","k");
FindChar("kumar","z");
FindChar("chandra","a");
System.out.println();
System.out.println("First Repeating Char in a String :");
String str = "Repeating";
char[] str1 = str.toCharArray();
char firstRepeating = FirstRepeating(str1);
printrepeating(firstRepeating,str);
str = "kranthi";
char[] str2 = str.toCharArray();
char firstRepeating2 = FirstRepeating(str2);
printrepeating(firstRepeating2,str);
str = "learn";
char[] str3 = str.toCharArray();
char firstRepeating3 = FirstRepeating(str3);
printrepeating(firstRepeating3,str);
System.out.println();
/*System.out.println("Last Repeating Char in a String :");
LastRepeating("kranthi","k");
LastRepeating("kumar","z");
LastRepeating("chandra","a");
System.out.println();
System.out.println("First Non Repeating Char in a String :");
FirstNonRepeating("kranthi","k");
FirstNonRepeating("kumar","z");
FirstNonRepeating("chandra","a");
System.out.println();*/
System.out.println("Counting Digits in A String");
CountDigits("Hi12233");
CountDigits("king");
CountDigits("singam123");
System.out.println();
System.out.println("Counting Even Digits in A String");
CountEvens("Hi12233");
CountEvens("king");
CountEvens("singam123");
System.out.println();
System.out.println("Reverse An Array");
revarray(arr1);
revarray(arr1);
revarray(arr1);
System.out.println("Reverse An Array");
revString("kranthi");
revString("kumar");
revString("chandra");
System.out.println();
System.out.println("Sorting a Integer Array using Bubble Sort");
bubbleSort(arr1);
bubbleSort(arr2);
bubbleSort(arr3);
System.out.println();
System.out.println("Sorting a Character Array using Bubble Sort");
String[] StringArray1 = new String[] { "A", "S","D","K" };
String[] StringArray2 = new String[] { "A", "F","D","K" };
String[] StringArray3 = new String[] { "M", "S","D","N" };
CharacterbubbleSort(StringArray1);
CharacterbubbleSort(StringArray2);
CharacterbubbleSort(StringArray3);
System.out.println();
System.out.println("Finding is prime number or Not?");
isPrime(3);
isPrime(25);
isPrime(31);
System.out.println();
}
}