Hi
Given an array of size N that contain some elements, Write a program for
finding all possible subset of size R .
n
i.e. P
r
Array :[1,2,3,4]
n=4,r=3;
Output should be:............
{1,2,3},(1,2,4).{2,3,4},{...} ................possible 24 sets.
Thanks
--
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.
