Using the methods used to obtain O(log N) routings of permutations, basic a
lgorithms on the star graph which are faster than those previously reported
in the literature are obtained. In particular, an O(log(2) N) sort and an
O(log N) Fourier transform are presented. A simulation of meshes is also gi
ven.