ConceptSystems & CS
Subset generation algorithm
A recursive function that generates all possible combinations of elements of all lengths from a given list by taking the last element aside, recursively generating subsets of the remaining list, and combining them.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.