부분집합 구하는 알고리즘 1234567891011121314151617181920212223242526272829#include int data[]={1,2,3,4};int flag[]={0,0,0,0}; void powerset(int n,int depth){ if(n==depth){ int i; printf("{"); for(i=0;i Algorithm/Coding 2018.01.10