Disjoint Boolean Products via Shannon's Expansion

It is shown how the well-known expansion theorem of Boolean (switching) functions theory can be used as the kernel of a powerful and extremely simple algorithm for producing a short disjoint products form of a Boolean function. Its efficiency may challenge other algorithms. Its ease of full documentation is a further positive feature, at least for teachers.