MC: Ping-Pong Cubes

[Maximilian Hohmann]

(05-27-2018 06:50 PM)ijabbott Wrote:  I think that depends on the scale of the problem to be solved though. If you need to sort (say) a million records, you probably shouldn't use the nearest \( \mathcal{O}(n^2\,)\) sorting algorithm that comes to hand. You should use an \( \mathcal{O}(n \log n) \) algorithm, and preferably one that makes use of auxiliary storage to minimize copying.

As you say, it depends. If you have to sort that list one time only, copy-paste the first sorting algorithm Google finds for you and let it run over night. If you need to sort it again every 10 minutes it might be worth thinking about a clever sorting routine first!