News for hackers. Stuff that matters.
Re:Stripe CTF3: Distributed Systems is live by dclara on Wednesday January 22, 2014 @04:49PM (#7105603)
Regarding the speed vs memory occupation, there should be comparison between linkedlist vs. hashmap. I remember that linkedlist is faster. So it depends on the language support.

You can google it more. I don't have time to find out about the Big O footprint for both now. Here is one link discussing about it:

http://stackoverflow.com/questions/7975802/when-to-use-hashm...

Re:Stripe CTF3: Distributed Systems is live by duaneb on Wednesday January 22, 2014 @05:03PM (#7105685)
Linear lists are.... linear. Hash maps are constant access. N doesn't need to get very large to see orders of magnitude difference—one you'll certainly see if you switch on level0.
Re:Stripe CTF3: Distributed Systems is live by cmelbye on Thursday January 23, 2014 @03:07AM (#7107383)
A linked list is not faster than a hash in looking up an element. The operation is O(N) for a linked list and O(1) for a hash.