3 ms·
I think you could get by with ~50 checks if you just used selection sort. I'm not sure what brute-forcing means in this context. Do you mean hard-coding every
by owenshen24 7y ago
I think you could get by with ~50 checks if you just used selection sort.
I'm not sure what brute-forcing means in this context. Do you mean hard-coding every way to order 10 unique elements?
- the8472 7y agoBrute force sorting would be generating permutations and checking if they're sorted. The non-deterministic version that uses random permutations is commonly called bogosort[0] [0] https://en.wikipedia.org/wiki/Bogosort https://en.wikipedia.org/wiki/Bogosort
- mjevans 7y agoThe thread switched problems and I didn't catch that. The 10 factorial was trying out all possible packing solutions and filtering for only the ones that were 'valid' (probably with an added step of also keeping the best valid configuration).