docs: public static int divide( int dividend , int divisor ) {
  		int length_end = length(dividend);
  		int length_sor = length(divisor);
  
  		if( length_end < length_sor )
  			return 0;
  
  		int result = 0;
  
  		for( int i = length_end-length_sor; i >= 0; i-- ) {
  			if((dividend & (1 << i + length_sor - 1)) != 0 ) {
  				dividend ^= divisor << i;
  				result |= 1 << i;
  			}
  		}
  		return result;
  	}