In this note, a modified Golomb algorithm for computing unit fraction expansions is presented. This algorithm has the advantage that the maximal denominators involved in the expansions will not exceed those computed by the original algorithm. In fact, the differences between the maximal denominators or the number of terms obtained by these two Golomb algorithms could be very significant, as illustrated by the examples chosen. Some examples on how to use this new algorithm in teaching are also included.