| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Comparison sort cannot be way better than N*log(N) | ||||||
| attached to Is It Possible to Implement Faster Binary Searches? | ||||||
| Re:It's not supposed to be faster ... | ||||||
| attached to Java IO Faster Than NIO | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Comparison sort cannot be way better than N*log(N) | ||||||
| attached to Is It Possible to Implement Faster Binary Searches? | ||||||
| Re:It's not supposed to be faster ... | ||||||
| attached to Java IO Faster Than NIO | ||||||
I've never been canoeing before, but I imagine there must be just a few simple heuristics you have to remember... Yes, don't fall out, and don't hit rocks.