Re^5: Help with Space Efficency algorithim

I need to think through the fragmentation aspect of this. In the extreme, if you choose the largest bucket that your data will fit into, you will always place your data in a new bucket. However, if you place the restriction that you must use an existing bucket if possible, I am not certain (yet) which will work better (select smallest bucket or largest bucket). It has been a while (a few years) since I have looked at this problem.

I always welcome thought excercises :)

--MidLifeXis

Comment on Re^5: Help with Space Efficency algorithim

Replies are listed 'Best First'.
Re^6: Help with Space Efficency algorithim by dragonchild (Archbishop) on Dec 28, 2007 at 04:32 UTC
The point I'm making is that there isn't a correct solution for all input sets. If you can know something about your input set, you can tune your algorithm. If you cannot, then a simple brute force algorithm may be the most maintainable solution. It's a rather generic point. :-) My criteria for good software: Does it work? Can someone else come in, make a change, and be reasonably certain no bugs were introduced?	[reply]

Replies are listed 'Best First'.

Re^6: Help with Space Efficency algorithim
by dragonchild (Archbishop) on Dec 28, 2007 at 04:32 UTC

My criteria for good software:

Does it work?
Can someone else come in, make a change, and be reasonably certain no bugs were introduced?

[reply]