>> Sure, but just as an example, what's the fastest way to sort a 10 KB 
>> array
>> when you have 16 KB or RAM?
>
> You just go and do it. I'm sure the sorting algorithm fits in the 
> remaining
> 6KB.
>
> Or did you get those two numbers backwards?

Actually I was thinking about algorithms that are not in-place (eg radix 
sort).  Whilst in a mathematical sense they might seem to be faster, if you 
start having to use slower storage (where some other algorithm doesn't) then 
obviously this might no longer be the case.

Post a reply to this message