private static int findUnfairness(int kids, int[] packets) {
		// Sort array using mergeSort O(n logn)
		mergeSort(packets);
		
		int minPointer = 0;
		int maxPointer = kids - 1;
		int minUnfairness = Integer.MAX_VALUE;
		
		// find mininum difference between packets within range kids O(n)
		while (maxPointer < packets.length) {
			if (packets[maxPointer] - packets[minPointer] < minUnfairness) {
				minUnfairness = packets[maxPointer] - packets[minPointer];
			}
			minPointer++;
			maxPointer++;
		}
		
		return minUnfairness;
	}