Improved coder placement algorithm performance

Improved performance from Θ(n²) to O(nlogn)

Current algorithm can take a lot of time, and it times-out as described on Issue #1099

You can compare the algorithms with these gists:

* Current: https://gist.github.com/Goodwine/e719e1954aec742ea190
* Proposed: https://gist.github.com/Goodwine/5e153dc05467aa3df518

One thing to note is that the original order is lost (because the array is sorted by totalPoints), but I didn't find any place that suggested that it would break something, in any case, I could update the code to revert the order if you wish.