Тёмный

Big-O Notation in 100 Seconds 

Fireship
Подписаться 3,1 млн
Просмотров 467 тыс.
50% 1

Learn Big-O Notation in 100 Seconds (of Computer Science). ⚡🔬
#compsci #100SecondsOfCode
Install the quiz app 🤓
iOS itunes.apple.com/us/app/fires...
Android play.google.com/store/apps/de...
Upgrade to Fireship PRO at fireship.io/pro
Use code lORhwXd2 for 25% off your first payment.
My VS Code Theme
- Atom One Dark
- vscode-icons
- Fira Code Font

Наука

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

 

17 дек 2019

Поделиться:

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 307   
@TheUntitledworks
@TheUntitledworks 4 года назад
The kid crying is exactly how I feel when someone asks me about time and space complexity 😢
@Fireship
@Fireship 4 года назад
same
@vladpascari
@vladpascari 4 года назад
Keep this 100s project, it's amazing! 👏
@yogenp
@yogenp 4 года назад
That's how i feel if someone asks me if my code is efficient.
@codeaperture
@codeaperture 2 года назад
@@Fireship haha.. the best way to respond to a junior dev is senior saying he doesn't understand either
@efrainpineda664
@efrainpineda664 2 года назад
Same here
@sharukh7860
@sharukh7860 4 года назад
I'm so pissed off at this because it ends at 100 sec.
@muhammadfaateh6463
@muhammadfaateh6463 4 года назад
same here
@mohanbarman5982
@mohanbarman5982 4 года назад
99 sec.
@alessandrobelottidev
@alessandrobelottidev 4 года назад
@@mohanbarman5982 right
@davidgkirk
@davidgkirk 4 года назад
It is 100 seconds because it has O(n^2) with n=10 and a one second delay in the inner for loop since the bubble sort is executing on a Commodore 64.
@Shizool
@Shizool 4 года назад
It's year 2030, computer science universities go bankrupt because everyone is learning from fireships 100s videos instead of lectures. Keep it up ! 😁
@ACodingWoof
@ACodingWoof 3 года назад
Yeye. I basically learnt basic js without a course. All I did was watch fireship vids.
@vaisakhkm783
@vaisakhkm783 2 года назад
@@ACodingWoof wow that's amazing...
@ACodingWoof
@ACodingWoof 2 года назад
@@vaisakhkm783 yup ikr
@justwaterweight
@justwaterweight 2 года назад
Watching One hour fireship video >> Learning one semester
@orvvro
@orvvro 2 года назад
@@justwaterweight ==
@piotrszewczyk9749
@piotrszewczyk9749 4 года назад
Dude! your materials are like O(1/n)... The more advanced concepts you take, the shorter and easier to comprehend your material is :) keep it up! you're doing a great job
@arhamaneeq3685
@arhamaneeq3685 4 года назад
I'm just asking here, but if you were to have code with the complexity of O(1/n), would that mean the program works less efficiently with fewer inputs than with greater? Also, I doubt it's pragmatic, but is it possible to have an algorithm with the complexity of O(1/n)
@MsSuyash1995
@MsSuyash1995 4 года назад
@@arhamaneeq3685 I think that O(1/n) is not possible since the number of computations grows as the size grows.. We might use memoization to store some recurring intermediate results in cache but even then, there is still slight addition to the computational time... Also, O(1) is the fastest time any possible computational operation can take... Having an algorithm that has a Big O of 1/n would mean that it's faster than O(1) which is an impossible task to achieve...
@javabeanz8549
@javabeanz8549 4 года назад
@@MsSuyash1995 maybe when quantum computing has general availability ;0)
@mthf5839
@mthf5839 3 года назад
@@MsSuyash1995 this seems kinda like O(1/n) to me: the problem: your inputs are an array, you are supposed to return an element from that array with index greater than 500. the algorithm to do it: pick a random element from the array. Check if it is at index 500 or greater. If it is, return in, otherwise, try again. Is this O(1/n) on average? Or given what you said about being faster than O(1), maybe it's O(1 + 1/n)?
@ehwu393
@ehwu393 3 года назад
@@mthf5839 No. Random number generation and array lookup based on index are both O(1) time complexity. Also this algorithm will loop forever for arrays shorter than 500, so there is no average time complexity. Getting the index of an array element based on its value is on average O(n) time. Also I don't get why you would bother getting an item from an array, when you could just check if the number is above 500 right after you generated it.
@AlienAndrew51
@AlienAndrew51 4 года назад
It took me forever to understand this, even when I was taking data structures in college. I really like the way you explain this as it's very similar to CS50, the free course that Harvard provides, but you do it in 100 seconds.
@Fireship
@Fireship 4 года назад
Nice! I'll have to check that out
@yocheeseify
@yocheeseify 4 года назад
Can you explain my life in 100 seconds too? You're amazing man 🔥
@hugodsa89
@hugodsa89 4 года назад
He'd probably sum it up in less than 100 seconds, just saying lol
@mapengbo0314
@mapengbo0314 4 года назад
I will watch every single video this GOAT is making
@lord12790
@lord12790 4 года назад
From Application Development to Software Engineering to now Computer Science... Looks good for audience of this channel. Keep up the good work. Much needed video for people who are not from computer science and well explained from perspective of Computer Science and Engineering Graduate.
@ancna0156
@ancna0156 Год назад
You explained this better in 100 seconds than my professors did in college over 5 months.
@carltongordon
@carltongordon 4 года назад
this taught me more than the weeks I spent watching tutorials on this
@stachowi
@stachowi 4 года назад
I'm jealous of any current CS students who have these videos... YOU HAVE NO IDEA HOW LUCKY YOU ARE!
@kentutterback6485
@kentutterback6485 4 года назад
After sharing the first #100secondsofcode video I made a comment wishing for this to be a series. I'm very happy to see it as a reality. Thank you
@Fireship
@Fireship 4 года назад
Awesome!
@RagePeanut
@RagePeanut 4 года назад
I remember having trouble understanding how the Big-O notation worked years ago. This video will be so useful for students around the world, thank you !
@GabrielLima-og5qd
@GabrielLima-og5qd 4 года назад
I'm really glad that we have people like you here in RU-vid, awesome videos with amazing quality and great knowledge. Have you ever considered making videos about Programming Paradigms? Design Patterns?
@GameMuse
@GameMuse 4 года назад
Thank you. Had a whiteboard interview with logic questions and my RU-vid feed has been all about them, this is the first video to tell me what the maths was people kept using to show their thinking!! Big O notation, ahhhhh the relief and all in 100 seconds! You god
@invisibleimpostor299
@invisibleimpostor299 4 года назад
Seriously though, these 100 seconds are probably the most useful 100 seconds until now and for what I will be needing it.
@kissu_io
@kissu_io 4 года назад
Wow, by far the best explanation that I've ever seen (thanks to the graphs). 👌🏻
@khamalipowell
@khamalipowell 4 года назад
I'm loving this concept of code in 100 seconds. Keep going please
@misterkenwong
@misterkenwong 2 года назад
I absolutely love the art style and of cos the way you presented! Can you please please please make the 100 seconds series along with like x mins series for more in dept details?
@shapelessed
@shapelessed 2 года назад
One thing about big O is that in some cases you'd actually want to use the less optimal algorithm. Crazy optimised search algorithms for example will introduce a lot of overhead before actually performing the search and this only scales well with big numbers where searching over an array that we know is gonna be just a few items long would be better off with a normal for loop.
@ampersignia
@ampersignia 4 месяца назад
Was confused by a course I'm taking, and am relieved after seeing this. They really overcomplicated it, and you nailed it.
@just_jimmy
@just_jimmy 4 года назад
Do more of these videos! I think the format is awesome! Maybe even a bit more than 100s wouldn't hurt. I presume it would a bit easier for you also to fit everything in.
@davngo
@davngo 4 года назад
Extremely great fun for this. Short, sweet and to the point with great visuals.
@lukewright5544
@lukewright5544 2 года назад
you have the gift to explain something allegedly complex in a simple manner. i salute you.
@Aziqfajar
@Aziqfajar 4 года назад
These 100s' videos making me motivated to do one for study purposes. Really like it!
@robbierob6917
@robbierob6917 Год назад
Your Videos have the Best Visualizations! Thank You Fireship!
@hierophantpurple8020
@hierophantpurple8020 Год назад
These short form videos really help me learn better than long lessons with power point slides, especially with my adhd.
@pj1986
@pj1986 4 года назад
Love the format, amazing as always.
@tythedev9582
@tythedev9582 4 года назад
I love this. Your succinct explanations cleared up this topic for me. Thank you very much, liked and saved!
@Marcosmapf
@Marcosmapf 4 года назад
This is really good content, i'm surprised you summarised it in such short ammount of time. Great work and keep going!
@CerFrus
@CerFrus 2 года назад
best 100 productive seconds I've ever seen, thanks man!
@bhagawatikishore2336
@bhagawatikishore2336 2 года назад
I have taken up this mission to watch all your videos and like it
@user-dl5cl6li9p
@user-dl5cl6li9p 3 месяца назад
not even kidding i watched this video about 30 seconds before i started my test that covered this, thank you for the short form!
@jrhaven
@jrhaven 3 месяца назад
This is way more helpful than my CS prof's lecture, thank you!
@David-jn1gg
@David-jn1gg 2 года назад
Thank you ,all the other online definitions made it so hard for me. But I finally understand what BigO notation means
@barbieroalex
@barbieroalex 4 года назад
please please keep doing this great work, just amazing! thk u
@erez7020
@erez7020 4 года назад
Amazing production value, thanks buddy.
@grosssocks3699
@grosssocks3699 9 месяцев назад
its so weird how i tried to learn this big o concept from various sources like udemy, youtube, coursera, etc since past few years but only being able to fully understand today at around 3:15 AM. Thanks a lot Fireship for helping an about to graduate cs student
@zainroyan1556
@zainroyan1556 9 месяцев назад
Bro istg this dude explain things better and easier to understand
@trophieboi1820
@trophieboi1820 4 года назад
loving this short daily clips..................waitin for more.
@kostiabazrov-life
@kostiabazrov-life 3 года назад
AMAZING LESSONS !!! DREAM LESSONS!
@Shmack_
@Shmack_ 4 года назад
Love these videos keep them coming!
@mujeexminiminer7653
@mujeexminiminer7653 4 года назад
This is amazing as always!! Please share the tools you use for making such amazing videos. Thank you for all your hardwork❤
@hojdog
@hojdog 4 года назад
Didn't knO this was gonna be a series, great idea!!
@tkp2843
@tkp2843 4 года назад
WE WANT MOREEEEE! GREAT VID!
@Gentarozzo
@Gentarozzo 4 года назад
This is so cool and visual... thanks mate!
@pladselsker8340
@pladselsker8340 4 года назад
yo thank you so much! That's literally the kind of teaching I'm looking for on youtube. This video was super efficient and taughtfull, you saved me some damn time man, I love you xD I feel so satisfied right now
@ramonmaximiliano3557
@ramonmaximiliano3557 2 года назад
This was amazing really, you made it very simple to understand in a short time, thank you
@divinedela9125
@divinedela9125 4 года назад
This is so cool. Perfect for reference
@qazyhn94
@qazyhn94 4 года назад
Just amazing, please continue
@MightyCoffeeMaker
@MightyCoffeeMaker 4 месяца назад
The best video on the subject.
@how-to2346
@how-to2346 2 года назад
I think I FINALLY understood it!
@FangerZero
@FangerZero 2 года назад
Thanks, for explaining what it actually is. Everyone else dives into explaining the different kinds of Big-O Notations.
@edgarr_com
@edgarr_com 3 года назад
Thanks for this! It would be nice to see a video on how to calculate the big O notation of functions. 🤜
@user-jw8sx1pw6w
@user-jw8sx1pw6w Год назад
OMG after all this years I finally understand it%)
@naveedalirehmani4135
@naveedalirehmani4135 2 года назад
This video is amazing explained so much in such a short period of time.
@worldgamer8550
@worldgamer8550 4 месяца назад
Very well explained, thank you!
@hl7297
@hl7297 4 года назад
I'm more impressed by the effort you put in making the thumbnails
@BassheadMusicConnoisseur
@BassheadMusicConnoisseur 4 года назад
Just when i needed it, ty
@samuelkahunga5987
@samuelkahunga5987 4 года назад
very high quaility video, as always. God bless
@CesarICAO
@CesarICAO 4 года назад
You reminded me of my algorithm analysis and design classes in the university 📚😁 Ty for all 😁
@nebraska7891
@nebraska7891 4 года назад
Thank you Jeff!
@aiman1562
@aiman1562 4 года назад
I love it btw!! We want more 100s
@CariagaXIII
@CariagaXIII 4 года назад
finally someone explained this perfecctly
@gabrielaudette7345
@gabrielaudette7345 4 года назад
You omitted the factorial O(n!)
@c-cg
@c-cg 4 года назад
These videos are too good, keep it up!
@yashsharma3857
@yashsharma3857 4 года назад
Wow that's great explanation in just 100 seconds . We need more videos like these . 😅
@realryleu
@realryleu 2 года назад
“Always simplify your notation down to the fastest growing thing” Kinda sounds like the funny calculus thing you can do when you’re taking the limit of x as it approaches infinity. \[\lim_{x\to\infty} \frac{x^3 + 1}{x^4 -7} +3 = 3\]
@GODDAMNLETMEJOIN
@GODDAMNLETMEJOIN 2 года назад
Because it's a real life application of the same thing.
@haiderimam8977
@haiderimam8977 2 года назад
Thank you mate thank you so much❤️
@transmissions1135
@transmissions1135 4 года назад
YES! Another one!!
@viniciusgoncalves8208
@viniciusgoncalves8208 2 года назад
Simply amazing
@psybitcoin
@psybitcoin 4 года назад
Really good video. Simple. Fast. Knowledge.
@MANTLECURVE
@MANTLECURVE 4 года назад
Thanks for these 100s videos :)
@dinkopehar982
@dinkopehar982 4 года назад
This is amazing explanation is such short time 😮
@azr_sd
@azr_sd 4 года назад
Dammnnn it's simple and to the point..cheers and happy new year 😊
@charan_75
@charan_75 3 года назад
Your editing skills are impressive.
@kriztoperurmeneta7089
@kriztoperurmeneta7089 4 года назад
This format is good!
@odrazleinad
@odrazleinad 3 года назад
Just excellent!
@omarz5009
@omarz5009 4 года назад
Best 100 sec of my time.
@DragonStoneCreations
@DragonStoneCreations 2 года назад
This 100 seconds was taught to us in college for several hours, yet we didn't had this level of clarity
@sachethana
@sachethana 2 года назад
Bro, for some reason, it's today that I understood what big O notates. (8 years as a software eng. Lol) thanks
@dishanmadhuranga8032
@dishanmadhuranga8032 2 года назад
Your content is easy to understand..pls continue good work..
@CodingCatDev
@CodingCatDev 4 года назад
Are you serious this is the simplest and most succinct explanation EVER!
@flamingninjas7856
@flamingninjas7856 5 месяцев назад
GREAT VIDEO.
@GaetanoBarreca
@GaetanoBarreca Год назад
Thanks!
@nonamenolastname59
@nonamenolastname59 4 года назад
Please make an in depth series about algorithms and data structures
@bamnjphoto
@bamnjphoto 4 года назад
I remember doing a technical interview a few years ago and being asked about Big O and I was dumbfounded. I then studied up on it afterwards. This was the best explanation I have seen condensed into 100 seconds
@winkbrace
@winkbrace 2 года назад
And have you ever had to use Big O in you daily job? Ever?
@bamnjphoto
@bamnjphoto 2 года назад
@@winkbrace no not ever in 20+ years of programming, it just a tech interview question to weed out candidates
@sazk4000
@sazk4000 2 года назад
thank you for this
@probhakarsarkar2430
@probhakarsarkar2430 4 года назад
The length of this channel videos has constant time complexity
@bitp
@bitp 4 года назад
Really helpful, I always read about log(n) performance and had kind of the right idea about it in my head but wasn't sure if it was correct. Never bordered to check it online, so thanks for this awesome video :)
@lord12790
@lord12790 4 года назад
O(log n) one of the most efficient algorithms have it like quick sort. Others like merge sort or heap or tim sort (tim sort is used in javascript v8 engine used in node and chrome) have O(n log n)
@Hauketal
@Hauketal 2 года назад
@@lord12790 Sorry, quicksort is O(n log n) too in the average case, even O(n²) in the worst case. It is just preferred over the others because those have larger coefficients hidden in the O.
@lin4409
@lin4409 7 месяцев назад
Hands down the best explanation 🫡
@kimaegaii
@kimaegaii Год назад
yes thank you!
@rizanmohomed8029
@rizanmohomed8029 4 года назад
100s segments are excellent
@shashidhar71
@shashidhar71 3 года назад
To the point 🙏🏼
@Qors1314
@Qors1314 4 года назад
Great content!
@StayAware9
@StayAware9 2 года назад
Very important video
@jenson274
@jenson274 4 года назад
So far one of my favorite js programming channel
@rubenheymans1988
@rubenheymans1988 4 года назад
can you recommend others? I can't find more programming channels that cover angular/firebase , go fast enough and are not Indians (just don't like the hard to understand accents, I'm not native English) ...
@jenson274
@jenson274 4 года назад
Coding train, thenewboston cant think from the top of my head but this 2 r pretty good
@sumitsawant
@sumitsawant 2 года назад
I want more!
@toxoreed4313
@toxoreed4313 9 месяцев назад
better than most of videos
Далее
Array Reduce in 100 seconds
1:41
Просмотров 217 тыс.
Big-O Notation - For Coding Interviews
20:38
Просмотров 416 тыс.
ААААА СПАСИТЕ😲😲😲
00:17
Просмотров 689 тыс.
Il pourrait encore jouer 🤩
00:23
Просмотров 1,4 млн
🥔 Sloppy Joe Potato Casserole ~#Shorts
00:23
Просмотров 4,2 млн
Learn Big O Notation In 12 Minutes
12:18
Просмотров 182 тыс.
10 regrets of experienced programmers
8:16
Просмотров 1 млн
Learn Big O notation in 6 minutes 📈
6:25
Просмотров 207 тыс.
God-Tier Developer Roadmap
16:42
Просмотров 6 млн
Naming Things in Code
7:25
Просмотров 2 млн
Getting Sorted & Big O Notation - Computerphile
10:59
Просмотров 316 тыс.
100+ Computer Science Concepts Explained
13:08
Просмотров 2,4 млн