static public int estimateHeight(final int entryCount,final int branchingFactor){
  if (entryCount < branchingFactor)   return 0;
  final double logm=Math.log(branchingFactor);
  final double logn=Math.log(entryCount);
  final double h=(logm / logn) - 1;
  return (int)Math.ceil(h);
}

static public int estimateHeight ( final int entryCount , final int branchingFactor ) { if ( entryCount < branchingFactor ) return 0 ; final double logm = Math . log ( branchingFactor ) ; final double logn = Math . log ( entryCount ) ; final double h = ( logm / logn ) - 1 ; return ( int ) Math . ceil ( h ) ; }
compute the height of the b + tree from its entry count and branching factor ( this can also be used to find the minimum height at which there could exist a given range count ) .
