Brute Force Algorithm Applications in Subset Generation and Permutation Problems
Subset Generation and Permutasion Analysis Given a psoitive integer N, generate all possible subsets and permutations. For N=3, subsets are represented as binary tuples: (0,0,0), (0,0,1), (0,1,0), (0,1,1), (1,0,0), (1,0,1), (1,1,0), (1,1,1). Permutations for N=3 are: (1,2,3), (1,3,2), (2,1,3), (2,3,...