What is the fastest way to get all the keys between 2 keys in a SortedList?

Question

Given a populated SortedList. I would like to get all the keys (or their index range, what should be a closed int interval (mis

Answer 1

As the list is sorted you can use binary search to locate the endpoints of your interval. Worst case performance will be O(log n).