4 ms·
Damn, now I'm going to waste time today actually trying to figure out how to implement a radix sort with red-black trees, just in case.
by pklausler 10y ago
Damn, now I'm going to waste time today actually trying to figure out how to implement a radix sort with red-black trees, just in case.
- corporateslave 10y agoCould make or break your career.
- yumaikas 10y agoMy understanding (somewhat limited), is that you would never want to use a radix sort with red-black trees, as a tree should already have some sorting to it as is. Otherwise, why not just used a linked list? Besides, radix sorts are generally good for fixed-width data that has a known bound, like integers. Basically, this is made-up nonsense. It's good made-up nonsense though.
- pklausler 10y agoWhoosh.