What algorithm can calculate the power set of a given set?

by

Just count 0 to 2^n - 1 and print the numbers according to the binary representation of your count. a 1 means you print that number and a 0 means you don’t. Example:

set is {1, 2, 3, 4, 5}
count from 0 to 31:
count = 00000 => print {}
count = 00001 => print {1} (or 5, the order in which you do it really shouldn't matter)
count = 00010 => print {2}
        00011 => print {1, 2}
        00100 => print {3}
        00101 => print {1, 3}
        00110 => print {2, 3}
        00111 => print {1, 2, 3}
        ...
        11111 => print {1, 2, 3, 4, 5}

More Related Contents:

  1. How to generate a power set of a given set?
  2. Memory efficient power set algorithm
  3. How to find nth prime with complexity o(1)
  4. time complexity of recursion function
  5. Solve T(n)=T(n-1)+2n by backwards iteration method
  6. Best algorithm for detecting cycles in a directed graph [closed]
  7. How do you rotate a two dimensional array?
  8. How to convert floats to human-readable fractions?
  9. Is log(n!) = Θ(n·log(n))?
  10. How to implement a queue using two stacks?
  11. What is the fastest integer factorization algorithm?
  12. Graph auto-layout algorithm
  13. Linear time algorithm for 2-SUM
  14. Is there an algorithm for color mixing that works like mixing real colors?
  15. Create a random permutation of 1..N in constant space
  16. Algorithm to list unique permutations of string with duplicate letters
  17. Collision detection of huge number of circles
  18. The sieve of Eratosthenes in F#
  19. Fuzzy date algorithm
  20. Compute rank of a combination?
  21. generate all partitions of a set [closed]
  22. Efficiently selecting a set of random elements from a linked list
  23. Find if a point is inside a convex hull for a set of points without computing the hull itself
  24. RGB value base color name
  25. Myers diff algorithm vs Hunt–McIlroy algorithm
  26. Given Prime Number N, Compute the Next Prime?
  27. What are the pitfalls in implementing binary search? [closed]
  28. Can a Fibonacci function be written to execute in O(1) time?
  29. What Are High-Pass and Low-Pass Filters?
  30. Given a set of intervals, find the interval which has the maximum number of intersections

Leave a Comment