It’s odd that all the descriptions of basic programming operations, such as sorting, rely on pseudo code or complex formal logic. All we are doing is modifying finite sequences so it seems like we should be able to use ordinary algebra. I’m going to start by defining basic operations on finite sequences and then look at the usual algorithms for sorting them – all without either using any pseudo code or any formal methods.