3 ms·
How inefficient can a sort algorithm be with O(1) or O(n) memory usage?
by xorfish 8y ago
How inefficient can a sort algorithm be with O(1) or O(n) memory usage?
- karmakaze 8y agoRandom shuffle, verify if sorted.
- cookingrobot 8y agoMake a random list, see if it’s sorted, then see if it’s the same as your original set.