3 ms·
Same applies to trees thought: you have to multiply log n by that bit number, because each naive comparison will take O(bit number)
by lostmsu 7y ago
Same applies to trees thought: you have to multiply log n by that bit number, because each naive comparison will take O(bit number)