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.
-
-
Replying to @krismicinski
Right at Rust I was hoping that was going to (also) end with "prove their implementations correct".
3 replies 0 retweets 10 likes -
Replying to @ShriramKMurthi
Yeah I totally agree, but since most of these data structures rely on linking I suspect you’d have to use separation logic
2 replies 0 retweets 2 likes -
Replying to @krismicinski @ShriramKMurthi
In other words, I think this would be cool but don’t see how to make it a data strictures course, but maybe with enough work
1 reply 0 retweets 0 likes
Data strictures... nice. "Every task involves constraint, Solve the thing without complaint; There are magic links and chains Forged to loose our rigid brains. Structures, strictures, though they bind, Strangely liberate the mind." —James Falen, as quoted by dughof
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!