Learn Big O notation in 6 minutes 📈

[@Olegator56]

Those 6 minutes were more useful than 6 months of lectures. Thanks

[@CallMeAce153]

Good thing our professor needed 5 hours to explain that graph...

[@achillesbissias]

College is a scam but unfortunately we gotta do it lmfao

[@noamrtd-g4f]

Mine explained it in 5 minutes so no one understood it (lol) At least he came to a conclusion at the end

[@jasonwang-wg8wu]

Cold, crushing grip of academia got you too?

[@philippemts88]

Well, no one can understand it in a 6 min. video. It doesn't even show the formal definition of Big-O neither how to prove its theorems and properties.

[@ditz3nfitness]

Here too, lol. I didn't understand a single thing, and nobody else did either @@noamrtd-g4f

[@berkan5018]

It's preposterous that you can make everything this simple and smoothly learnable. Thx a lot for real

[@redaboukdir5678]

I made a summary for this lesson in the same way that Bro uses and I would like to share it with you, bros public class BigONotation { /** * Big O Notation (how code slows as data grows): * it describes the performance of an algorithm as the amount of data * increases. * * it is machine independent but we are focusing on the "number of steps" to * complete an algorithm. * * examples of Big O notations: * O(1) * O(n) (n = amount of data) * O(log n) * O(n^2) * ... */ /** * concrete example: * addUp1() method will add up to a certain number (n). * * ex: * if n = 3 -> sum = 0 + 1 + 2 + 3 -> sum = 6. * here, the number of steps is 4 because we have one operation * (sum + i) repeated 4 times (n

[@Evoyde_]

Thank you bro !!!!

[@thanosmylonas9781]

Thank you so much Bro

[@DMPLAYER1000]

Thank you bro! I am in love with you for this

[@ninoe9124]

such a goat fr bro

[@CountDracula-vq8zn]

Tried it, addUp1 is faster compare to addUp2. addUp2 is only fast if there are more numbers/steps whilst addUp1 is fast if it is less numbers/steps

[@saurabhbasak9545]

Idk man there's something about your presentation and the colors you use that grabs my attention and now I'm actually understanding these concepts. Thanks Bro!

[@rishabhverma7064]

I just discovered this channel and goes through the python course I must say...... U deserve 🙏🙏🙏🙏🙏

[@wrathofainz]

"Prays" lmao

[@soulfulsolitude116]

Dumbo that emoji is also used to express gratitude. ​@@wrathofainz

[@ditz3nfitness]

Just as I'm getting introduced to this topic on the third semester of my Software Engineering degree in a course called Algorithms & Data Structures, I get recommended this video! Thanks, Bro Code!

[@youvegotmail9385]

I kinda somewhat get Big O notation now on a high level. that graph helped so much. Google in 3 years here I come!

[@modaprogrammer]

hope u got the position u wanted now!

[@danser_theplayer01]

For anyone wondering, O(√n) is between O(n) and O(log n). It also has a cousin O(√(n)/2) which is literally 2 times smaller even in the worst case scenario, it's important to read non simplified O notation when calculating total time (not general complexity) for your specific algorithm.

[@lelo_7375]

Isnt O(sqrtn) polynomial time? O(n^x) since its O(n^(1/2))

[@omardumet120]

Please keep making more videos about this it helps for interviews thanks bro

[@flashbao1922]

The guy needs to be seriously appreciated!

[@roytescaro6313]

Great video Bro, just a quick note. When you said (at minute 5:15) that an algorithm that has O(n**2) can be faster than a O(n) algorithm if n is very small showing the graph, the part in which n**2 < n is only when 0 < n < 1 and since we're talking about data size then n is a positive integer and it is at least n = 1. The only way an O(n**2) algorithm can be faster than an O(n) algorithm is if there are hidden constants that have been omitted (since time complexity is asymptotic), an O(n) algorithm might actually be O(c1*n +c2) where c1 and c2 are constants. And depending on how large are these constants then you can find n > 1 such that c1*n + c2 > n**2 and therefore n > 1 such that the O(n**2) is faster than the O(c1*n +c2) ~ O(n) algorithm.

[@wenterinfaer7868]

The things I've always adored about computer science is how I struggle understand a topic until something snaps in my head, and it all becomes child's play.

[@lemapperium5344]

The easiness of this man's explanation is incredible

[@ahmedxficeh7894]

That was the best explanation of the topic i found on the whole internet. Thank you very much

[@BPEKSupraInteractive]

Wow. Thanks for helping me understand Big O here than the 3 weeks we spent on in class lol

[@ChrisAthanas]

Universities are about to go bye-bye

[@hariprasaanth]

I jus wanna let u know that I'm highly addicted to your channel (after java beginner playlist)and I badly want u to complete DSA asap before facing placements Keep up the good work broman 😂

[@thatChillLife2037]

This was a GREAT explanation! I struggle with this as I learned to code in a bootcamp that did not study it and I don't have a CS degree. Thanks so much for the examples, helped a bunch! I will be rewatching :)

[@mactenssheelal1840]

Man, really thank you!!! I'm just learning for my Data Structures and Algorithms exam next week on my Uni, and Big-O was one of a few things, that I couldn't fully understand. Thanks to you now I understand it clearly

[@anaballesteros7282]

Honestly, the best explanation of Big O, thanks you!

[@moglimogify]

Very useful. As a bonus I didn't know the sum of n is the same as n*(n+1)/2

[@HessaKhalfan-u8f]

I'm really grateful for this channel, it save me in a lot of time.

[@somethingwine]

Thank you! Great code examples to demonstrate the "steps" it takes. :D

[@bruno10505]

Man, thank you. I watched about 2 hours of my teacher talking about it, and in the end, I didn't even know how to tell the big O of my own algorithm, now, 10 minutes later, I understood it with a 6 min yt video

[@mahendranath2504]

Thank you so much bro code, I'm watching your channel,it will grow bigger then your expected

[@CoffeeXmusic]

Super clear and concise. Thanks bro!🎉

[@johnquintana-bo2xy]

I learned more in 6 minutes , then I did going to class and tutoring for the past couple of weeks

[@yohanmaharanasingha9343]

Simple and covered. Thank you From Sri Lanka

[@mohammedrangoonwala9328]

That was just an amazing video. Keep up the hardwork and effort you put into your videos.

[@AnthonyR007]

Yoooo, My favorite comp sci. channel is back at it again Have you looked into rust at all? I’ve just started diving into the documentation, and I gotta say, it’s so much better than anything else I’ve used previously

[@ThapeloMachaka256]

this man is the plug!

[@hermitmobile1742]

This right here is a great man

[@walrexx_2370]

this video explain well the topic. Thank you alot for your time for making this tutorial video.

[@hrld0]

good to hear you in a non-coding video lesson, bro!

[@jackvianey1630]

You are amazing, Bro!!

[@PythonDS]

Great explanations! Thanks for share.

[@BbabbittGolf]

Extremely straightforward

[@deepdaddy1208]

I have always enjoyed your humour, cheers and great vid

[@rewardx]

what humor?

[@estelle9819]

this is so easy to understand. thanks bro!

[@andresroca9736]

Cool Bro! Great to see data structures and algorithms here. Please, more on these. Your channel is getting better and better. Subscribed!. Muchos saludos 🤙

[@melonolandsorryformybadeng2815]

Bro code is different than other tutors xD. awesome

[@Balanceiskey-nd6el]

Thank you! This is a great foundation for me to learn more.

[@zohirboshi2245]

You are such a great man keep it going 💞🔥

[@mrsdhuha]

This is amazing summary, many thanks!

[@dribrahimel-nahhal2477]

Excellent amazing video. Thumbs up 👍 .

[@AbhijeetKumar-cm3jh]

bro is on the way to 100k 🥳 really looking forward for future vids

[@leoniaklebanov2502]

Awesome and simple, thanks a n!

[@snapreal9814]

Asante kwa maelekozo mazuri

[@raajroy5931]

bro i was a hater for learning bigO notation before watching your video. 😡 cause i cant understand that much.😬 you made me understand this bro. 😘 have you uploaded the "travelling salesman problem" video?🤨

[@smellthel]

“you get expelled” imagine getting expelled over bogosort lmao

[@Snowmanver2]

Amazing, thank you, bro!

[@Fawad-ew7qe]

Your video was o(1) for my mind ❤ thank you

[@alonasmatko9670]

Many thanks! This video is really good for beginners!

[@CSstudent_1001]

Nice explanation as usually 👍 🌸

[@matheusreuter9600]

Thanks, it blew my mind

[@itsashhuby6781]

i love this guy i stg

[@nikitos2442]

Underrated!

[@skolan4834]

wow very good explaination thank you!

[@AllYourMemeAreBelongToUs]

4:32 Quadratic time

[@llamadrama169]

Great explanation, thanks Bro!

[@marquinho1p]

fire explanation! thanks!

[@shiftshaddow6487]

After like ten videos, this is the best video by far. 0(1) for sure

[@jeremiahgatwechpeter4222]

You always rock it down bro!....huge admiration to yuh !

[@JJavierCueto]

Expelled from the school 😂. Excelente video hasta ahorita el mejor explicado

[@ProgamerEU]

Awesome overview

[@trntrinh79]

Thanks a lot for sharing all of this.

[@Helmansonable]

You could add the precise definition of Big O notation, not only the intuition behind it

[@MathsinAmharic]

Sir, I am very, very sorry not mentioning you title , you are great teacher,you just target what we learner need thanks a lot 😂❤❤❤❤❤

[@Diamond_Hanz]

Love your videos, brooo

[@ConfidenceGold]

Bro, Thanks! Appreciate it!

[@Maros554]

You're the bro

[@vishalkumar1313]

clear explanation 👌👌

[@_Curiosity_]

Useful video! Thanks bro

[@lanceroygames]

Great video man!

[@gerardsk8ordie]

thanks for the short explanation

[@Garrison86]

awesome explanation! Thanks

[@victorrezende6002]

Nice class

[@abderrahmane_saadi]

Thanks for your efforts

[@phinhhung2398]

My professor's explanation that took me 4 months but still didn't get it, until I saw this video.

[@maroofraktim293]

Great video bro, subbed.

[@emreotu4464]

Learn Big O notation in 6 minutes 📈

[@awwtawnoo]

which programming language are you gonna use for this DSA course?

[@mootee8575]

Amazing ❤

[@MellowJustin]

Thanks for these videos man

[@mondlistyleman9389]

Like I always say, my python hero

[@keerthansj845]

Awesome bro

[@wolanus]

Great video!

[@aoldatabase]

Thanks for the help

[@MultimediaCizzy]

PLZ MORE DSA. luv u

[@SizarieldoR]

Nice and succinct

[@charitharanasingha]

Nice explanation Bro!!!

[@adityarajsrivastava6580]

This was great!

[@PythonArms]

Great thanks!

[@vedantdeshmukh4949]

Hey Bro!!!! Hope u are doing well. Thanks for such awesome content🔥🔥🔥 Love❤️

[@yasserj3693]

You are the best

[@raiden_jay]

So we can also say that the shorter the data, the faster the supposed slow big O notations? Like 0(n^2) is faster than 0(log n). I'm no cs student so I'm bad at math 😞

[@kristijanlazarev]

amaaazing

[@kunalsoni7681]

such a amazing explaination by the help of graph 🤩

[@cjrozor918]

Thanks my Bro!

[@theencryptedpartition4633]

n! getting expelled is crazyyyyy, but I agree lol