> We have set named S. We assume we have an algorithm that specifies if > there is a subset in S that sum of it's elements equals to K in O(n) > and returns TRUE or FALSE.
That assumption is either wrong, or you have specified the problem incorrectly. Is "subset" the right word? Do you mean "substring"? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
