The growth factor and efficiency of Gaussian elimination with rook pivoting

There is an error in the indices in the description of Algorithm 1 on p. 179. We correct the algorithm below. The rest of the paper is consistent with the corrected algorithm. If we let A(k) represent the updated matrix at the kth step of Gaussian elimination and if we let aij(k) be its entries, then the algorithm for selecting the pivot element at step k in rook pivoting is: