In this note, we give comments on a very recent paper by J. S. Respondek [1]. In [1], the author claims that an algorithm in [2] contains a severe error. We show that the algorithm in [2] can be implemented properly without causing any errors by using vectors (one-dimensional arrays) rather than using 2-dimensional arrays. To enable users and programmers of the algorithm to carry out the computations using all existing subscripts and superscripts in the algorithm, we give a correction in the first line of the algorithm. A Maple implementation for the algorithm, as it is in [2], is given as an example for symbolic programming.