In this video, we go over the basics of algorithm analysis, and cover Big-Oh, Omega and Theta notation, as well as some simple examples of looping algorithms.

Skip to content
##
Coding Craze

### Learn Coding Online

Would this be O(n^2) or O(n^3) ? I got confused because your examples had not specified values for n

int n = 1000;

for(int i = 0; i < n; i++) {

for(int j = 0; j < n * n; j++) {

}

THANKS

great

Thanks this has really helped a lot.

thank you

BIG Thank you

Yes please make part 2 about recursion 🙂 You got really good videos.

Where is Part II ?

I start 2 out yet.

Great tutorial! Please make a Part 2 :)

Great video, really helped me understand it more, thanks!

You should go back to the white background during the introduction. It's easier to imagine that you're living in the Matrix. Great video!

Thanks a bunch. Looking forward to part 2.

very well explained.. (Y) .. thx for sharing it

This is great! You do a good job of boiling down a topic that students often struggle with early on. I imagine this video could be very helpful to our club members.

Keep up the good work! We're looking forward to part 2.