717	 Partitioning Algorithms for Finite Sets	 The partitions of a set with n elements are represented by certain n-tuples of positive integers. Algorithm are described which generate without repetitions the n-tuples corresponding to all partitions of the given set all partitions of the given set into m or fewer sets m n and all partitions of the given set into exactly m sets m n .
