2 ms·
Brute force sorting would be generating permutations and checking if they're sorted. The non-deterministic version that uses random permutations is commonly cal
by the8472 7y ago
Brute 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