Big O Complexity Ranking for Algorithms!

Big O Complexity Ranking for Algorithms!

#coding #leetcode #programming #interview

[GregHogg]

Crack big tech for free at algomap.io!

[ByteBeacon]

O(1) doesn't mean its fast though. if the constant is a big number it can be slow. for example for small datasets its faster to do linear search O(n) through a dynamic array than it is to do a hashmap lookup which is O(1)

[Johannes-cp]

O(n!) is not the worst, there is basically no end in how bad it can get.
pretty sure the ackermann function is worse.

[slayeryt]

If you don't know what this stuff is by heart already you have zero chance of passing a coding interview

[asagiai]

I think some sorting have different time complexity. So, it also depends on what sorting it is.

[tierthetora]

how does space complexity work?? im tryong to find out how to get the space complexity of a program

[sn]

instructions unclear. Downloaded with yt-dlp.

[CareaboutYou-uk]

is this knowledge only for coding interviews? or will it apply if you have to do your own libraries instead or using default downloaded ones...

[Steven-lyei]

God ive never been more glad to not care about working for some mega corp.

needing to understand how bad my dictionary comprehension is, just sint even relevant to my job 😅 why would i memorise it just for an interview?
i dont get

[XNOGLADIATR]

Bro what is this? How's this gonna help me with full stack development?

[OrestiOS]

Man n factorial time complexity is painful 😢