code: public void outputItemsPerList() {
  		int max = 0;
  		int min = Integer.MAX_VALUE;
  		double sum = 0;
  		for (int i = 0; i < numCoarseCentroids; i++) {
  			// System.out.println("List " + (i + 1) + ": " + perListLoadCounter[i]);
  			if (invertedLists[i].size() > max) {
  				max = invertedLists[i].size();
  			}
  			if (invertedLists[i].size() < min) {
  				min = invertedLists[i].size();
  			}
  			sum += invertedLists[i].size();
  		}
  
  		System.out.println("Maximum number of vectors: " + max);
  		System.out.println("Minimum number of vectors: " + min);
  		System.out.println("Average number of vectors: " + (sum / numCoarseCentroids));
  
  	}
docs: Utility method that calculates and prints the min, max and avg number of items per inverted list of the
  index.