MC: Ping-Pong Cubes

[ijabbott]

(05-27-2018 05:18 PM)Maximilian Hohmann Wrote:  And back on topic: I personally do not have objections about brute force solutions to mathematical problems. These days computer time is a lot cheaper than developer time and if a job needs to be done on a limited budget (as it is always in engineering and the industrial environment) "elegance" of the solution is the least of worries.

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.