ComputerScienceExpert
$18/per page/
- Give an example of a program that uses the nongeneric version of a class from the STL and the equivalent program that uses the generic version. How do the two implementations differ? Why is having the syntax of generics better?
- Implement a generic method that returns the minimum element in an array.
       public static<EextendsComparable<E>> E min(E[ ] list)
- Write a generic method that returns the maximum element in a two-dimensional array.
public static <E extends Comparable<E>> E max(E[ ][ ] list)
- Write a generic method that returns the largest element in an ArrayList:
public static <E extends Comparable<E>> E max(ArrayList<E> list)
- Write a generic method that returns a new ArrayList. The new list contains the non-duplicate elements from the original list.
public static <E> ArrayList<E> removeDuplicates(ArrayList<E> list)
Please provide a demo programs that used these methods ( You can have a demo for each method)
Example:
(Maximum element in an array)
Implement a generic method that returns the maximum element in an array.
public static <E extends Comparable<E>> E max(E[ ] list)
Implementation:
/*
Maximum element in an array.
Implement the following method that returns the maximum element in an array.
public static <E extends Comparable<E>> E max(E[ ] list)
*/
public class Demo_max {
public static void main(String[] args) {
Integer[] numbers = { 1, 2, -3, 7, 5, 4 , 11,12, 87, 23, -1, 0, 3};
for (int i=0;i<numbers.length; i++) {
System.out.print(numbers [i] +" ");
}
System.out.println();
System.out.println("Max= "+max(numbers));
}
public static <E extends Comparable<E>> E max(E[] list) {
E max = list[0];
for (int i = 1; i < list.length; i++) {
if (max.compareTo(list[i]) < 0) {
max = list[i];
}
}
return max;
}
}