Gaussian elimination

Gaussian elimination walks any augmented matrix to row echelon form, column by column, left to right: find a nonzero entry at or below the current position (swapping it up if needed), then use the replace operation to zero out every entry below it, and move on. Reaching row echelon form is finished by back-substitution, which solves the staircase's last row first and climbs upward.