Remove duplicated values from an integer array with using sorting. Complexity = O (n.log(n))

gistfile1.java

public static int[] sortAndRemove(int[] list) {
   list = mergeSort(list);
   int[] temp = new int[list.length];
   temp[0] = list[0];
   int j = 1;
   for (int i = 1; i < list.length; i++) {
      if (list[i] != list[i - 1]) {
         temp[j] = list[i];
         j++;
      }
   }
   return temp;
}