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

@Swift_Media

7 ай бұрын

College is a scam but unfortunately we gotta do it lmfao

@noamrtd-g4f

5 ай бұрын

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

@jasonwang-wg8wu

5 ай бұрын

Cold, crushing grip of academia got you too?

@philippemts88

5 ай бұрын

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

5 ай бұрын

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

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

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

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!

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

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

The guy needs to be seriously appreciated!

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!

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

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

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

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

@wrathofainz

5 ай бұрын

"Prays" lmao

@soulfulsolitude116

13 күн бұрын

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

The easiness of this man's explanation is incredible

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_

2 жыл бұрын

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

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

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

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

@ChrisAthanas

5 ай бұрын

Universities are about to go bye-bye

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

this man is the plug!

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

You are amazing, Bro!!

Super clear and concise. Thanks bro!🎉

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

You are such a great man keep it going 💞🔥

this is so easy to understand. thanks bro!

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.

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

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

This right here is a great man

I have always enjoyed your humour, cheers and great vid

@rewardx

3 жыл бұрын

what humor?

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 😂

Amazing, thank you, bro!

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

Great explanations! Thanks for share.

Awesome and simple, thanks a n!

fire explanation! thanks!

Underrated!

Excellent amazing video. Thumbs up 👍 .

Many thanks! This video is really good for beginners!

Thanks for these videos man

Great video man!

i love this guy i stg

This was great!

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

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

Love your videos, brooo

Nice explanation as usually 👍 🌸

awesome explanation! Thanks

Awesome overview

Thanks a lot for sharing all of this.

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

Awesome bro

Great video!

Bro code is different than other tutors xD. awesome

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

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

wow very good explaination thank you!

Nice explanation Bro!!!

Love you bro

Simple and covered. Thank you From Sri Lanka

PLZ MORE DSA. luv u

thanks habibi

Thanks my Bro!

Great thanks!

Thanks!

Respect bro 👊

by looking at the graph can someone tell me until what value of n should I use in each O(n)? for example if n=100000000000 it's better to acheive a solution that has o(1) but if n=1 it seems that O(n) is better

thanks bro!

Thanks for your efforts

You're the bro

thanks for the short explanation

You are the best

Needed this video bro

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

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

can you do a tutorial on webpack 5 ?

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

Revision covered, my g

Like I always say, my python hero

so Good thanks Bro Code

Legend

Thx Bro!!!

Thank you Bro

im learning this thing but i have no idea about anything in CS my major doesnt have CS - what should i study before this so i get a basic understanding?

Bro can you make tutorial for mips assembly?

cool!

Nice and succinct

Lets go!

amaaazing

Thanks bro

Thx bro

class video

Is this videos by order, should I watch the Playlist from the top?

thanks bro

such a amazing explaination by the help of graph 🤩

ty

Can you give me a document about data structure and algorithm?

Thanksssss❤❤

Asante kwa maelekozo mazuri

how can you have less than one data entry though?