No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
3 Posted Topics
 | Hi, you just need to create a class for example with name MyDistance containing the point id and point distance to the tested point. Then you define a comparator which help the sorting function to compare two object of MyDistance by the value stored in point distance member. When you … |
| | Hi as far as I know people usually use Heap to implement a priority queue because of its efficiency. The update cost of a heap is O(logn) with n is the total number of the elements in a heap. You can look at the book Introduction to Algorithms to take … |
| | Hi, I have to read and store 70 millions of Double objects in a Vector. The problem is that it seems that Java will allocate 40 bytes of memory for each Double object and the memory amount we need to store such number of Doubles object is approximately 2.8 GB. … |
The End.