An algorithm for producing all the non-isomorphic greedoids on the ground-set of a given cardinality $n$ is described. We have performed the corresponding computer search for $n\leq5$.