Big O Notations

MY UDEMY COURSES ARE 87.5% OFF TIL December 19th ($9.99) ONE IS FREE

Welcome to my Big O Notations tutorial. Big O notations are used to measure how well a computer algorithm scales as the amount of data involved increases. It isn't however always a measure of speed as you'll see.

This is a rough overview of Big O and I hope to simplify it rather than get into all of the complexity. I'll specifically cover the following O(1), O(N), O(N^2), O(log N) and O(N log N). Between the video and code below I hope everything is completely understandable.

MY UDEMY COURSES ARE 87.5% OFF TILL MAY 20th
Over 20 Hrs + 52 Videos + Quizzes + Graded Assignments + New Videos Every Month
Highest Rated Python Udemy Course + 48 Hrs + 199 Videos + Data Science

[tryingadult]

3:53 - O(1)
4:55 - O(n)
8:50 - O(n^2)
11:30 - O(Log(n))
15:20 - O(nLog(n))

[TheKaveshan]

gonna get my degree cause of this guy....

[Akshay-cjhq]

Most people don't like the speed, but I appreciate it. Thanks for making the tutorials fast and editing out time wasters.

[MCSGproject]

You're probably unaware of the time difference it takes most professors to explain this stuff compared to you.. And the clarity difference is unreal too.. Anybody in university who isn't aware of videos like this is at an extreme disadvantage.

[linusgo]

This guy is amazing! Explains things better than my lecturer ever can. Thanks so much for the clear and concise explanation

[SecularSerenity]

O(log N) on the streets, O(N^3) in the sheets.

[garrettburnett]

In a youtube community full of slow, unnecessary introductions, I appreciate the speed at which you jump into these lessons. Thank you so much and wish me luck on my data structures final!

[clarebornstein]

Your videos have completely saved my grades in my CS classes! I have some very nice, however confusing, professors and this really gave me the extra help I needed to actually understand what is going on in my problems sets. The speed at which you write the code and provide explanation is unheard of-- THANK YOU!

[leonamariesharpstene]

CS student at Cornell studying for an upcoming exam. This makes a million times more sense than all of the lectures and office hours I've attended! Thank you so much!

[Ben-kike]

The best explanation of Big-O Notation I've found. Thorough with clear examples given. Perfect!

[LarsCabrera]

This guy made more sense of this than any professor, lab assistant or book I have ever read. Thank you!

[derekbanas]

I'm glad it helped :) I wasn't sure how deep I should have gotten into the math involved. I'm glad I covered enough to make it understandable

[ankitagarwal]

have done my complete engineering and after 5 years found such an outstanding way to explain this complex Big O Notation..Thank You

[derekbanas]

It is a great way to quickly see how well different algorithms scale. It also gives a tip on how the algorithm works. I'll cover hash tables, trees, graphs, etc. next. Each is best in specific situations

[jonalice]

Oh dear, you edit things so tight and it is so valuable every second of the video. Admire your wizardry on Java codes not just for the algorithm analysis, but the whole Java coding also! And you say to a reply for a comment that you enjoy making these? Gifted!!!

[MrNelzya]

Subscribed. I love the speed and clarity. I came for Big O but I'm afraid I'm not going to be able to stop watching the rest of your videos. Really nice job.

[surferadi]

15:38
"We have to look at every single elevlvlllvlvvl"

[derekbanas]

Ja obaviti moj najbolji to pokriti svaku temu koja se traži od mene. Drago mi je da ti se sviđa. Neka Bog blagoslovi vas i vašu obitelj, kao i :)

[derekbanas]

Thank you for the compliment :) I'll hold a vote soon and see who wins. I would definitely like to cover C++

[RoanHidalgo]

Crystal clear tutorial on Big O Notation principles. I just needed a refresher of this algorithm analysis concept I learned in college; you turned about two weeks worth of frustration and confusion  (in college) into 20 minutes worth of clarity and bliss (on YouTube)