Following up on a discussion I had with another teacher here, I decided to briefly investigate the running time of insertion and deletion on mutable vs immutable hash tables. I was a bit disappointed to find that it turns out that insertion really doesn’t look very constant-time for insertion… or for lookup, actually. I drew some pictures: tell me what you think!
https://www.brinckerhoff.org/blog/2017/05/25/hash-table-timings/ John (praise and adulation, as always, to Messrs. Butterick and Hendershott for pollen & frog, respectively) -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
