One more thread is running parallel on the same topic............ Please refer : http://comments.gmane.org/gmane.comp.programming.algogeeks/17279
On Wed, Jul 27, 2011 at 7:39 AM, Nikhil Gupta <[email protected]>wrote: > Given a string of length 5 (example "abcde"), write a program to print all > the possible combinations OF LENGTH 3. > > In this case : abc, abd, abe, acd, ace, ade, bcd, bce, bde, cde > > Can someone provide a working code? > > -- > Nikhil Gupta > Senior Co-ordinator, Publicity > CSI, NSIT Students' Branch > NSIT, New Delhi, India > > -- > 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. > -- Thank You Rajeev Kumar -- 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.
