2020-06-19 22:24:45 +0200 | asked a question | Can you help me write an algorithm that gives me the number of k subsets of a n member set? like {1,2,3}--->two subset---->[{1,2},{1,3},{2,3}] Can you help me write an algorithm that gives me the number of k subsets of a n member set? like {1,2,3}---two subset---->[{1,2},{1,3},{2,3}] |

2020-06-19 22:22:49 +0200 | commented question | why is it wrong Can you help me write an algorithm that gives me the number of k subsets of a n member set? like {1,2,3}---two subset---->[{1,2},{1,3},{2,3}] |

2020-06-14 16:14:28 +0200 | commented question | why is it wrong error again |

2020-05-30 15:10:14 +0200 | asked a question | why is it wrong The code: |

2020-05-30 02:08:07 +0200 | asked a question | Please help me write a function that receives a set and then gives all its subsets Please help me write a function that receives a set and then gives all its subsets |

2020-05-30 02:08:07 +0200 | asked a question | Please help me write a function that receives a set and then gives all its subsets Please help me write a function that receives a set and then gives all its subsets |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.