Is there any efficient algorithm for computing all semigroups of order n?
You asked the same question here
and I answered it. Jean-Eric's algorithm is for computing the elements (among other things) of a semigroup defined by a generating set, and is not related to your question.