Hi,
I have a question concerning the best (fastest) data structure to use for my program.
I give an example.
There are 100000 items to store with key and value.
In my program I have to take the item with the lowest value, change that value and store it again with the new value.
I have to do that many 1000 times.
The number of items and keys are not changed but always the values
So it is very important to do that in a minimum of time.
What should be the most fastest method ?
Thanks for any response
I have a question concerning the best (fastest) data structure to use for my program.
I give an example.
There are 100000 items to store with key and value.
In my program I have to take the item with the lowest value, change that value and store it again with the new value.
I have to do that many 1000 times.
The number of items and keys are not changed but always the values
So it is very important to do that in a minimum of time.
What should be the most fastest method ?
Thanks for any response