Please make this java program work Instruction: Write a test program that inputs, sorts, outputs Integer and Float. And call the isEqualTo method.
Please make this java program work
Instruction: Write a test program that inputs, sorts, outputs Integer and Float. And call the isEqualTo method.
import java.util.*;
public class Generics <E>{
public static < E > void printArray( E inputArray[] ) {
// Display array elements
for( E element : inputArray) {
System.out.printf("%s ", element);
}
System.out.println();
}
public static < E extends Comparable<E> > void selectionSort(E array[]){
int size = array.length;
for (int i = 0; i < size-1; i++){
// Find the minimum element
int min = i;
for (int j = i+1; j < size; j++)
if (array[j].compareTo(array[min]) < 0)
min = j;
// Swap the found minimum element with the first element
E temp = array[min];
array[min] = array[i];
array[i] = temp;
}
}
public static < E > boolean isEqualTo(E inputArray, E inputArray2){
//if (inputArray == inputArray2){
// System.out.println("TRUE");
//}
//else{
// System.out.println("FALSE");
//}
return inputArray.equals(inputArray2);
}
public static void main(String[] args) {
// TODO code application logic here
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number of Integers: ");
int int_num = sc.nextInt();
System.out.println("Enter the number of Float numbers: ");
int float_num = sc.nextInt();
Integer[] n = new Integer[int_num]; //generic integer array
Float[] f = new Float[float_num]; //generic float array
System.out.println("Enter Integers: ");
for(int i = 0; i < int_num; i++){
int x = sc.nextInt();
n[i] = x;
}
System.out.println("Enter Float numbers: ");
for(int i = 0; i < float_num; i++){
float y = sc.nextFloat();
f[i] = y;
}
selectionSort(n);
System.out.println("Sorted Integers: ");
printArray(n);
selectionSort(f);
System.out.println("Sorted Float numbers: ");
printArray(f);
System.out.println("Are they equal?");
if(isEqualTo(n,f)){
System.out.println("TRUE");
}
else{
System.out.println("FALSE");
}
}
}
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
