Assuming the worst case with 4 billion elements:
log_2(4 billion) = 32
So 128 billion operations or 500GB of memory read and writes if everything is touched only once. Anything below that is peanuts.
You need unimaginably large numbers to make sorting slow. How am I going to find that much data?
Assuming the worst case with 4 billion elements:
log_2(4 billion) = 32
So 128 billion operations or 500GB of memory read and writes if everything is touched only once. Anything below that is peanuts.
You need unimaginably large numbers to make sorting slow. How am I going to find that much data?