I do a lot of embedded development. We're concerned about the worst case. It doesn't matter how fast the sorting algorithm is on average, it only matters how fast it is in the worst case.
Any language which does garbage collection (like Rust) is highly suspect. If it does garbage collection at random times (like Smalltalk), it's completely useless (to us).
Rust may be fine for some use cases, but it's not, nor will it ever be, a suitable replacement for C - and that's Okay. The real question Rust-heads should be
Bubble sort is also fine if you call the sort for each new added item, like i did for a disk caching algo I wrote back in the dark ages. It's always one pass then,
Rust Garbage (Score:1)
I do a lot of embedded development.
We're concerned about the worst case.
It doesn't matter how fast the sorting algorithm is on average, it only matters how fast it is in the worst case.
Any language which does garbage collection (like Rust) is highly suspect.
If it does garbage collection at random times (like Smalltalk), it's completely useless (to us).
Rust may be fine for some use cases, but it's not, nor will it ever be, a suitable replacement for C - and that's Okay.
The real question Rust-heads should be
Re:Rust Garbage (Score:2)
Bubble sort is also fine if you call the sort for each new added item, like i did for a disk caching algo I wrote back in the dark ages. It's always one pass then,