Search:

It's ok if you don't understand big-O for now. I'm sure sometime in the future you will take a CS algorithm class, and they will go over all the gooey bits of big-O notation.

I think for now, it's...

Link: Big O notation

Basically, that's the time it takes your algorithm to run with respect to some value n (usually how many times through you have to go). Big O is very useful when n is huge,...

I don't think this is possible in just 1 for loop. It's really not useful to have a loop inside a loop inside a loop here... remember, each inner loop contributes to the overall run-time. My code...

Hehe, yeah, i don't know why i decided to put it inside a method, but I was just going through the algorithm for any general width.

I'm kind of confused by what you mean by fully nested loop. I...

Haha, it's ok chronoz. You're turning out to be quite the programmer :)

Haha, I actually just found a slight problem in the algorithm i posted. I forgot to draw the end underscores :) Here's the...

:( That's not the purpose of us helping you. We're here to help you learn, not just blindly give you the answer.

I must say, though, nice work chronoz13.

The code's going to look somewhat different than the one chronoz gave, but it's the same general idea. It all comes down to what's the pattern? Once you can figure out a simple algorithm, it's not...