Modified Gram-Schmidt QR factorization for matrix inversion

QR decomposition Algorithm

This Algorithm implements Modified Gram-Schmidt QR factorization. I wanted to use it to implement non-square matrix inversion. I've tested it and it works fine when m>=n. but when m<=n it doesn't. I compare the results with

    (inv(transpose(A)*A)*transpose(A)).

is there something wrong with the algorithm? or am I doing something wrong?

[Jan]

Please do not let us guess, what you observe. What does "doesn't work" exactly mean?