@greghogg5: Time Complexity - Big O(n) vs O(2n) vs O(n^2) #softwareengineering #softwaredevelopment #java #software #softwarejobs #softwareengineer #datastructures #leetcode #programming #javadeveloper #datastructuresandalgorithms #python #softwaredeveloper #code #FAANG #coding #javascript #javascriptdeveloper #codingisfun #codinginterview #js #html #css #sql
Greg Hogg
Region: CA
Thursday 02 May 2024 14:05:45 GMT
Music
Download
Comments
Greg Hogg :
Had to do it... I hope this was helpful! I was getting a lot of questions about Big O complexity and O(n) vs O(2n) vs O(n^2) etc so I hope this helps!
2024-05-02 14:14:52
8
Ahh :
Why my boy explain it so simple and more clearer than my comp sci prof back in school😫
2024-05-02 15:54:55
6
Greg Hogg :
Follow for daily coding and DSA posts, and drop a like to keep these in your feed. Also join the discord (link in bio) if you haven't already!!
2024-05-02 14:14:27
2
mark :
The legend comes back with another one
2024-05-02 14:48:26
1
Emma :
i still don't like how we remove constants 😭
2024-05-03 09:19:33
1
jav.i0 :
Ty for explaining big o notation in a way I can understand !
2024-05-04 11:28:50
1
Furt_Tech Industries :
prove its bounded within theta and omega
2024-05-02 14:19:50
0
Bro~Stars 💚❤️ :
what vscode theme is this?
2024-05-05 08:26:02
0
x_ :
this man is a legend😅😅, keep on doing that bro we are learning🙌🙌🔥
2024-05-06 13:05:08
0
kenanz :
that last one isn’t a function!
2024-05-08 20:45:49
0
user2538017214964 :
You should throw in a few blyaaaaaat’s
2024-05-24 19:01:34
0
To see more videos from user @greghogg5, please go to the Tikwm
homepage.