but I am not making any use of the fact that the data is sorted
This sounds like unnecessary consideration. Once you have data in hashtable, based on hashtable implementation you can even have sorted data available through iterator.
On 12/2/05, Jay <[EMAIL PROTECTED]> wrote:
I have to read a large file where every line is timestamped and the
file is sorted by timestamp. I need to store all that data in some good
data structure so that later on I can easily do calculations on data
between two timestamps meaning I will have to search based on date-time
later.
If I use hashtable to store as I read each line from file, search
may be good later but I am not making any use of the fact that the data
is sorted.
