In this, the most basic of algorithms, we sort socks by selecting the largest one.
Imagine a drawer full of socks, each with its own unique personality.
We must navigate this chaos, one sock at a time, until all are paired and justifiable.
Start with the first sock in the drawer, which will become our current maximum.
Next: Insertion Sort, where we insert our new sock into the perfect spot Or: Merge Sort, for when we need to merge our sock collections