Well. this seems interesting question. 1> You have to break the string to the lowest possible subset. I know O(log n) algo for this.
2> Number of possibilities of creating a second sentence from this subset. This is subset formation and I guess will take O(nlogn) atleast for n possible elements. On Wed, Dec 28, 2011 at 2:55 PM, Tamanna Afroze <[email protected]> wrote: > how? > > > -- > 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?hl=en. > -- 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?hl=en.
