code: function ( obj, divisor ) {
  		var result  = [],
  		    total   = obj.length,
  		    nth     = Math.ceil( total / divisor ),
  		    low     = Math.floor( total / divisor ),
  		    lower   = Math.ceil( total / nth ),
  		    lowered = false,
  		    start   = 0,
  		    i       = -1;
  
  		// Finding the fold
  		if ( number.diff( total, ( divisor * nth ) ) > nth ) {
  			lower = total - ( low * divisor ) + low - 1;
  		}
  		else if ( total % divisor > 0 && lower * nth >= total ) {
  			lower--;
  		}
  
  		while ( ++i < divisor ) {
  			if ( i > 0 ) {
  				start = start + nth;
  			}
  
  			if ( !lowered && lower < divisor && i === lower ) {
  				--nth;
  				lowered = true;
  			}
  
  			result.push( array.limit( obj, start, nth ) );
  		}
  
  		return result;
  	}
docs: Splits an Array by divisor
  
  @method split
  @param  {Array}  obj     Array to parse
  @param  {Number} divisor Integer to divide the Array by
  @return {Array}          Split Array