Question

Write a method that removes all duplicates in an array A of N
items. Needless to say, your method should be implemented in a class and must use Java 5 generics.
It should also return the number of items that remain in A. Your method must run in O(N logN)
time (use quicksort as a preprocessing step), and should make no use of the Collections API. An
example signature of the method would be
public static> int removeDuplicates(T [] array)

Answer 1

What have you done so far?

Answer 2

have the recursion (quick sort method ) not yet to understand the the method structure and removing the duplicates help me @lyrae

Answer 3

If you have a sorted array, wouldn't the duplicates be grouped together? So if array[i] == previous, delete array[i] and manage the index.