private RangeCompare compareRange(AddressRange range1, AddressRange range2) {
		Address minAddr1 = range1.getMinAddress();
		Address maxAddr1 = range1.getMaxAddress();
		Address minAddr2 = range2.getMinAddress();
		Address maxAddr2 = range2.getMaxAddress();
		return compareRange(minAddr1, maxAddr1, minAddr2, maxAddr2);
	}
Determines if the optimal algorithm for an operation.  Generally set operations can be done
either by applying each range of the given address set to this set OR by linearly visiting
each range in both this set and the other set.  The first approach involves doing a
binary search in this set for each range in the given set costing Nlog(M) operations where
N is the size of this set and M is the size of the other set.  The second approach involves
visiting every range in both sets in order so the cost is N + M.  Therefor, if N+M is less
than Nlog(M), we should use a linear algorithm.

@param set the other address set to operate against.
@return true if a linear algorithm will likely be faster that a series of binary searches.
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/address/AddressSet.java