Small question about javascript. From my understanding, whenever I view a webpage that requires a js file, the file is downloaded to the client computer and accessed from there. Are any checks...

Thanks a lot. That helped me understand stuff a lot better although it still takes me time to figure out all the variables. I hope I get better at it eventually. :o

The function is

6 * 2 ^ n + n ^ 2

From what I have read I need to find two constants c1 and c2 such that c1 g(n) <= f(n) <= c2 g(n) for all n >= n0. Would appreciate it if someone could...

Sorry, that was a stupid question. I understood my own question on a second read of your earlier post, thanks again.

Wow, I'm going to copy and keep that. Thank you very very much.

Quick question, since theta is an exact rate of growth, it can't have two values right, for the same algo/function?

I've been trying to get it to work but it just won't. For some reason everytime I run a program it freezes up my command prompt and I have to close it forcefully. Does anyone know a fix to this?
...

But theta is a tight bound right? So why does the theta of the same equation vary?

Sorry but I'm new to this and I think it's all in the english. My english isn't that great, one big reason why...

That's what I thought but this page (http://www2.toki.or.id/book/AlgDesignManual/BOOK/BOOK/NODE14.HTM) says different, rather the figures on the page say different. It's got me confused.

Can you explain a bit more please? I can't understand what you're trying to do.

Thanks for that narue.

One more question. I have understood how to calculate the O of a simple algorithm but does that O depend upon the size of N as well? I read in an online book somewhere that...

Thanks for the lovely explanation Narue. I have a couple of questions though.

I assume that when you said the complexity for the following code was O(N log (N)), you meant the average case...