docs: public static int[] addToSortedIntArray(int[] a, int value) {
  		
  		if(a == null || a.length == 0) {
  			return new int[] {value};
  		}
  		
  		int insertionPoint = -java.util.Arrays.binarySearch(a, value) - 1;
  		if(insertionPoint < 0) {
  			throw new IllegalArgumentException(String.format("Element %d already exists in array", value));
  		}
  		
  		int[] array = new int[a.length + 1];
  		if(insertionPoint > 0) {
  			System.arraycopy(a, 0, array, 0, insertionPoint);
  		}
  		array[insertionPoint] = value;
  		if(insertionPoint < a.length) {
  			System.arraycopy(a, insertionPoint, array, insertionPoint + 1, array.length - insertionPoint - 1);
  		}
  		
  		return array;
  	}