I have the following code to find a match for a number in a list of ranges.
public class RangeGroup { public uint RangeGroupId { get; set; } public u
May be use a sorted list and do a binary search. That way you reduce the number of comparisons to O(logN)