pdgetrf
BAN USER
Comments (6)
Reputation 10
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
I said it wrong, if the new distance is smaller than the max of the 10-element array, which is at one end of the array since the array is kept sorted, simply throw away the max and insert the new distance in, much like in insertion sort. And since the array has up to 10 element, the insertion takes O(10) each time a new distance is inserted or O(1) if larger than the max. As to heap, we also only keep up to 10 elements in the max heap
- pdgetrf March 28, 2012Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
a linked list of (char*)
- pdgetrf March 29, 2012