How to efficiently search a sortedset with an inequality?
<p>Ok say I have a strongly typed SortedSet of type int. I want to find the largest number in the set that is less than x.</p>

<p>Maybe this is the wrong data structure for this but my intuitive thinking is that I have a sorted collection. Surely it makes sense that I should be able to do this type of search via the .NET framework?</p>