How can I make my own function to transform a NxN+1 matrix of any size to row echelon form without any built in functions??

Please help!

I have a matrix of any size and I need to turn it into row echelon form without using any built in functions how can I do this. I can figure it out for one given matrix but not any matrix inputted. I also need to create another function that will solve the matrix thats in row echelon form to make x_1=?...X_n. Can someone help please??

[Guillaume]

This may be of interest: what-can-be-programmed-without-any-built-in-functions

Note that +, -, *, <, >, ==, matrix indexing (subsref) and assignment (subsasgn) are all built-in functions.

[John Chilleri]

I think Christopher means without using rref or any similar function (at least I hope so!).

I would suggest you read up on Gaussian elimination and find an algorithm that you can implement piece by piece.

Note: the Wikipedia page on Gaussian elimination has pseudocode that you may find helpful (many places probably have pseudocode).

Good luck!