Hacker News Reader

in theory, no, in practice, yes.

By "in practice" do you mean with one-implementation languages?

If there's more than one implementation, there better be a standard, and it's risky to assume any behavior not specified in the standard will be shared by all implementations.

Even with one-implementation languages it becomes risky to assume behaviors will remain the same as the implementation evolves.

i mean the whole ecosystem, compiler, CPU, etc. I think that the compiler will produce performant code, and i think that the CPU will execute code that operates a certain way faster, and that its pretty safe to assume this.

Basically, I think that in 10 years, in practice, radix sort will still be faster than quicksort, despite theory saying its slower.

Theory says radix sort on a set of strings runs in time linear in the sum of the sizes of the strings.

Reply on news.ycombinator.com