The fact that something is short does not mean it's "simple". Simple is something that's easy to understand. And while it's pretty clear that one could explain

The fact that something is short does not mean it's "simple". Simple is something that's easy to understand. And while it's pretty clear that one could explain this in simpler terms, it's never going to be "simple" because it relies on a side effect and direction of (what may seem to be) the core logic (in iteration i, put the largest number at A[i]). So no, this ain't the "simplest sorting algorithm".