I can’t believe that I can prove that it can sort
He starts from the wrong axiom that its hard to prove and creates a lot of nonsense over that.<p>Its requires just two induction proofs:
- One that for I=1, after N comparisons the largest number is at position 1 (Proven with induction) its the base case
- The other, that for any I=n+1 if we assume that the first n slots are ordered we can treat n+1 as a new array of length N-n and solve using the base case proof.<p>Talking about computer science and not doing the bare minimum of computer science is peak software engineering :)