really wish I could teach a hard graduate-level data structures course where we cover hamt, qd trees, b trees, fibonacci heaps (generally, amortized structures), bloom filters, etc.. and did it all in Rust/C++ where assignments had students profile implementations for cache perf.
-
-
Still, I don’t think either of those tools allow reasoning about separating conjunctions, which is what you need for many of these DS
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
Read my blog!