3

I am supposed to be implementing mergesort without recursion. I've finished all that jazz, but the class is not compiling for reasons outside the domain of the homework assignment. Here is the problem:

This aspect is taken directly form the textbook...

 public <T extends Comparable<? super T>> void Mergesort(T[] a){
  T[] tmpArray =(T[]) new Comparable[a.length];

1 warning found:

File: /Users/OcastaEshu/Java/NonRecursiveMergesort.java [line: 22]

Warning: /Users/OcastaEshu/Java/NonRecursiveMergesort.java:22: warning: [unchecked] unchecked cast

found : java.lang.Comparable[] required: T[]

Shahzeb
  • 4,745
  • 4
  • 27
  • 40
Ocasta Eshu
  • 841
  • 3
  • 11
  • 23

1 Answers1

1

If you want to avoid the warning, you can do something like that:

public static <T extends Comparable<? super T>> void Mergesort(T[] a, Class<T[]> clazz) { 
    T[] tmpArray = clazz.cast(Array.newInstance(a.getClass().getComponentType(), a.length));
}

Where classOfelement is a.getClass(). I agree, it is ugly and you'd better use a @SuppressWarnings instead of that kind of code.

Jerome
  • 4,472
  • 4
  • 18
  • 18