give a set with n integers, partition it into two sets with equal
sum-value
how can I do it efficiently?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to
not a spam
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For
There is a lot of detail available on-line. If you google "Dictionary
of Algorithms and Data Structures", and visit there, you'll be amazed
at the depth of the info.
A good book (not too hard, but something that covers the basics), is a
great asset to have. Perhaps someone here can recommend a go
