@greghogg5: Big O Complexity Ranking for Algorithms! #leetcode #coding #programming #codinginterview #softwareengineer #datastructures #datastructuresandalgorithms #FAANG

Greg Hogg
Greg Hogg
Open In TikTok:
Region: CA
Saturday 02 December 2023 13:00:00 GMT
89484
5598
36
105

Music

Download

Comments

ferskt.egg
Ferskt Egg :
the chart's only helpful if you already understand what each O means. And at that point the chart is not needed
2023-12-03 13:06:44
114
jo.milot
Jo.Milot :
You definitely can do worse than O(n!) lol
2023-12-03 23:21:22
14
bubblestand888
SoftandWet :
What about O(0)
2023-12-05 12:56:01
0
allu7111
Allu71 :
I ended up getting O(tree(n))
2023-12-27 00:07:31
1
widrolo
Widrolo :
Bogosort has the potential to be O(1)
2023-12-17 10:25:26
0
arenavlab_
ricky🗡 :
1. wouldn't O(n^n) be the worst notation (if possible obv) 2. isn't O(ln(n)) faster
2023-12-19 05:25:38
0
bjornp_
bjornp_ :
O(1) does not mean quick and does not mean the same everytime. It only means that e.g. the length of the input n doesn't influence the runtime; may still take a million years though
2023-12-16 10:22:49
0
peetapaka
someRandomDude :
Ok, but quantum computers don’t care about any of this…
2023-12-22 13:45:10
0
ramvildi
Vlad :
The chart is a bit confusing tho bc O(2^n) is actually waaaaay worse than O(n^2) and here it looks like they’re both comparable
2023-12-05 07:40:27
17
physicsnick
nick :
you should know this concretely in your mind without the chart, this stuff is really foundational
2023-12-07 19:38:41
8
garlicflavormarshmallow
garlicflavormarshmallow :
O(2^n) is even worse than what this chart shows. For any finite k, O(2^n) is worse than O(n^k). It doesn't matter how large k is
2023-12-07 21:53:32
2
eyal.eyal
eyal :
Can always divide two of the functions and find the lim n-> infinity
2023-12-03 13:09:20
1
nightcom850
Nightcom850 :
algorithms 2 made us give a big O of each method.
2023-12-09 00:51:35
1
odie60
Odie :
@Nermal
2023-12-04 01:13:22
1
joer779
Joe R779 :
Why is O(n) slope not 45 degrees? 😂
2023-12-08 01:51:27
0
cnml.de
Michi :
Also note that the actual runtime is more or less unrelated and that sorting a specific amount of items is always O(1)
2023-12-05 12:50:16
0
monzleeb
user3334964209245 :
I reckon I could do worse than n!, what about n!^n!
2023-12-11 06:12:23
0
oojassalunke8
oojas salunke :
Can you do a complete leetcode series?
2023-12-19 13:55:28
0
wallzjon_12
Jon :
👌
2023-12-20 18:20:56
0
tanner_jarring
Tanner Jarring :
What a dumb video
2023-12-29 14:22:13
0
To see more videos from user @greghogg5, please go to the Tikwm homepage.

Other Videos


About