Тёмный

Simple explanation of Asymptotic Notation! 

Keith Galli
Подписаться 227 тыс.
Просмотров 60 тыс.
50% 1

Опубликовано:

 

9 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 28   
@braedonwatkins967
@braedonwatkins967 3 года назад
I love this video. It also helps that you sound like mordecai from regular show
@guitargatekeeper
@guitargatekeeper 5 месяцев назад
You saved my life
@chadlitecel7410
@chadlitecel7410 2 года назад
Good job brother, thanks!
@bubblesgrappling736
@bubblesgrappling736 4 года назад
so "tight" means that the function is in between some other values?
@caseyyeow1649
@caseyyeow1649 4 года назад
Very good analogy using the grocery lists. Can you help to add into the analogy with O(1), o(n)?
@AL-go2mv
@AL-go2mv 6 лет назад
Great video! Thanks!
@ajirusani7307
@ajirusani7307 6 лет назад
Thanks for your help
@shroomdoggg
@shroomdoggg 6 лет назад
I don’t know why I’m watching this I’m in 7th grade
@backtotheorigins848
@backtotheorigins848 6 лет назад
lol
@catmanboy0
@catmanboy0 5 лет назад
Nice, getting that RU-vid education.
@bashiryousufy1
@bashiryousufy1 3 года назад
God is calling upon you to not take computer science
@manusartifex3185
@manusartifex3185 3 года назад
go play fortnite
@shroomdoggg
@shroomdoggg 3 года назад
@@manusartifex3185 congrats on being two years late dicknips
@gkmishra2009
@gkmishra2009 7 лет назад
Give lecture on - Brute Force, Greedy method, branch and bound, backtracking , dynamic programming , asymptotic analysis (best,worst,average cases), of time and space , upper and lower bound, basic concept of complexity classes- P, NP,Np-hard,NP-complete, graph and tree algorithm , depth breadth first traversal , tractable and interactable problem
@KeithGalli
@KeithGalli 7 лет назад
Thank you for the ideas, it is very helpful! I'll try to put some more lectures out on these topics in the next few weeks :)
@samjones50
@samjones50 5 лет назад
6ncube = theta(n squre) 2 power n+1 = big oh ( n square) 2 power n = big oh ( 2 power n) n sqare not belong small oh ( n square) 100 . n not belong omega n square can anyone help me in this questions please
@WanSyazlina
@WanSyazlina 5 лет назад
Can someone explain to me what upper bound mean. How does it look like on the graph?
@KeithGalli
@KeithGalli 5 лет назад
For a large value of x, graph G is said to upper bound graph F if it always has higher y values (is always above graph F as x approaches infinity)
@dilayfundauysal9378
@dilayfundauysal9378 2 года назад
Hello teacher, can I ask you a question?
@jagratigunani9497
@jagratigunani9497 6 лет назад
very slow voice
@jc8153
@jc8153 6 лет назад
jagrati gunani adjust the playback speed to 1.5 and problem solved
@sublime_tv
@sublime_tv 4 года назад
prefer a slow voice over a fast one when learning something. 1.5x speed to solve your problem
@perseusgeorgiadis7821
@perseusgeorgiadis7821 2 года назад
Guys someone tell him about playback speed
@c.d.premkumar6867
@c.d.premkumar6867 3 года назад
Very shallow explanation.
@perseusgeorgiadis7821
@perseusgeorgiadis7821 2 года назад
I'm sorry but I have to ask... What exactly did you expect from a 10 minute video on a topic with ENTIRE COURSES dedicated to it?
@TheKillerninga
@TheKillerninga 5 лет назад
get better sound quallity
@DootyDuck
@DootyDuck 3 года назад
how is this bad audio quality lol
@perseusgeorgiadis7821
@perseusgeorgiadis7821 2 года назад
get some bitches
Далее
1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1
15:46
Big-O Notation - For Coding Interviews
20:38
Просмотров 465 тыс.
Solving Wordle using information theory
30:38
Просмотров 10 млн
Asymptotic Notation 3 - Example of Big O Notation
6:55
How To Self-Study Math
8:16
Просмотров 2 млн
The Boundary of Computation
12:59
Просмотров 1 млн