Because on Linux you can create such apps very easily with this Chrome feature, and I'm pretty sure even cookies/history is separate from the main Chrome instance.
Or is this better/different in some way?
19 karma · joined March 26, 2015
Because on Linux you can create such apps very easily with this Chrome feature, and I'm pretty sure even cookies/history is separate from the main Chrome instance.
Or is this better/different in some way?
Actually, the author says that all dict operations take O(1) time, which is the best (or average) case and not the worst case. I think it should at least mention the worst case! No hash table exists where you get worst case O(1) (non-amortized) for all three of insertion, deletion, and lookup. You either have to resize the table at some point or you have to deal with hash collisions.
(BTW, I've been asked this question numerous times in job interviews and answering O(1) without qualifying the statement is definitely wrong.)
See https://wiki.python.org/moin/TimeComplexity
and http://cs.stackexchange.com/questions/249/when-is-hash-table...
2. The article linked is merely rephrasing the answer explained in a Forbes article instead of actually quoting the source. A simple link to the Quora answer would have sufficed.