NeetCode (@neetcode1) 在 Piclur：I was just watching a video about algorithm performance by the @ThePrimeagen . It reminded that Big-O complexity is not always the final story.When choosing a data structure, it's useful to consider the 'composition hierarchy'.You can implement an algorithm using a Hash… / Piclur

NeetCode

2024年9月18日

I was just watching a video about algorithm performance by the @ThePrimeagen . It reminded that Big-O complexity is not always the final story. When choosing a data structure, it's useful to consider the 'composition hierarchy'. You can implement an algorithm using a Hash…

NeetCode

@neetcode1

2024年9月18日

Here's the video btw: youtube.com/watch?v=U16Rnp… Genuinely one of the best videos I've ever watched

anushk

@anushkmittal

2024年9月18日

cool but premature optimization is the root of all evil

NeetCode

@neetcode1

2024年9月18日

i agree, that's why arrays are better than hashsets in many cases, for some ppl this is counter intuitive

pragma

@_prabu_nat

2024年9月18日

Man, fake language is paying my bills

setpedro

@setpedro_

2024年9月18日

"prob because you use a fake language like JS or Python"😂😂😂

GuessNope

@Quazil84

2024年9月18日

The correct term for this consideration is called "cache coherency". This is why linked-list are virtually never faster than the corresponding array of pointers even after memory allocation optimizations.

Toughware Guy

@__toughware__

2024年9月19日

Also, With small amounts of data the chances of key collision is high And in some implementations, key collisions are handled by using a linked list - which might result into 0(n) lookup in the worst case

saibal kole

@SaibalKole

2024年9月20日

What do you mean by fake language 😭?

o_cristiano

@ocristiano8

2024年9月18日

@Ze_Canelha

ishicodz

@ishicodz

2024年9月21日

Woowww 😲

James

@jmac_ai

2024年9月18日

I agree. Moreover, if someone is deciding what approach to use for a specific application solely by big O ordering, they probably don't understand what big O is.