3 ms·

Might not. The Rust standard library has a state of the art sort implementation. There’s nothing faster, in any language - https://github.com/rust-lang/rust/pu

Might not. The Rust standard library has a state of the art sort implementation. There’s nothing faster, in any language - https://github.com/rust-lang/rust/pull/124032 https://github.com/rust-lang/rust/pull/124032. And sure, it’s possible that someone could write a C program that compares in speed to all the Rust programs I’ve mentioned. C is a Turing complete language after all. I’m only pointing out that it hasn’t happened in practice. Also check the Android Binder code before (C https://github.com/torvalds/linux/blob/master/drivers/android/binder.c https://github.com/torvalds/linux/blob/master/drivers/androi...) and after (Rust - https://android.googlesource.com/platform/frameworks/native/+/master/libs/binder/rust/src/binder.rs https://android.googlesource.com/platform/frameworks/native/...). Same speed but the quality difference, it’s incomparable.

igouy 2y ago
> And sure, it’s possible … Because anecdote. We can only know when the thing is designed as an experiment. (All credit to who-so-ever is working to write improved versions.)
- nindalf 2y ago
  > Because anecdote I don’t think anyone could have said something more rude or ignorant if they tried. > designed as an experiment Ha. As if you could design such an experiment. What, you’ll place two rats at a keyboard and ask them to implement grep? Bffr. I’m pointing out the obvious - no one has actually written these mythical C programs that outperform Rust, to say nothing about security and reliability. You’ve deluded yourself into thinking that all it needs is “an experiment”. lol.
  - igouy 2y ago
    The quoted text seems dictionary definition anecdote.