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 --~--~---------~--~----~------------~-------~--~----~ 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 more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
