[algogeeks] Re: Efficient data structure to store sorted timestamped data

[Abhi]

As the data is sorted, you can always use binary search to find your
data elements. This would take log(n). I believe you must have thought
of this before, so do you need better time-complexity than this?

Regards,
-Abhishikt