Well, just look up "integer partitioning" ... I won't recommend printing all possible partitions, though.
On Wed, Apr 2, 2008 at 1:20 AM, karan <[EMAIL PROTECTED]> wrote: > > Hi, > > We have to develop an algorithm to compute the number of different > ways in which an integer k can be written as a sum, each of whose > operands is less than n. > > A recursive approach would be easier to understand. It would be great > if the operands are printed too, but the main task is to return the > no. of ways. > > > -- > Thanks & Regards > > Karan > > > > > -- Fear of the LORD is the beginning of knowledge (Proverbs 1:7) --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
