I think it was actually supposed to be an insertion sort; that's why I provided a (correct) version of insertion sort in the answer I gave.
To be honest, not understanding how the sort works seems to be 90% of tsj's problem; maybe it would be better to use a bubble sort as that is easier to understand.
I don't really agree with this, because if taken literally, I think he's going to end up splitting the actual sort
across several functions, which is going to be a nightmare.
Tsj: What I would do is just go back to the code I gave you that worked (at least I think it worked for you). All you need to do is replace the bit that compares the points (in the for statement) with a check to see if "compare(a,b) < 0" (where a,b are the two things you're comparing: team[j] and T or some such).