Approach 2: Compare last with all above

Work this method by hand.

Summarizing:

• Start from top (i = 1) and repeatedly compare (and swap if needed) $a(i)$ with $a(n)$ (not $a(i+1)$ like last time!) until $i = n - 1$. (this pushes biggest number to bottom of array).
• Start again from top (i = 1) and repeatedly compare (and swap if needed) $a(i)$ with $a(n - 1)$ until $i = n-2$. (this pushes second biggest number to bottom-1 of array).
• ...

  (continue like this, how many times?)

We need to understand ``repeated'' execution of same statements (called LOOPS). Then we can write above cleanly!