public void findElementsThatApprearNbyKTimesUsingSorting(int[] input, int k) {
if (input == null || input.length == 0)
return;
Arrays.sort(input);
int i = 0, start = 0, end = -1, n = input.length;
while (i++ < k) {
start = end + 1;
end = start + n / k – 1;
int index = findFirstOccuranceOfANumberInSortedArrayUsingBinarySearch(input, start, end, input[end]), temp = index + n / k – 1;
if (index != -1 && temp < n && input[temp] == input[end])
System.out.print(input[index] + " ");
}
System.out.println();
}
private int findFirstOccuranceOfANumberInSortedArrayUsingBinarySearch(int[] input, int start, int end, int num) {
while (start <= end) {
int mid = (start + end) / 2;
if ((mid == 0 || input[mid – 1] = num)
end = mid – 1;
else
start = mid + 1;
}
return -1;
}