Well, if you are using Java, this is pretty darn easy to do. Each node could have a list of node references (or pointers, in other languages) within its structure. For example:


class Node {
...

The first one is obviously a geometric series, google is your friend if you haven't had that level of math yet.

Don't mess with the second one. n! is O(n!), and it is also O(n^n) (but not...

Hehe, ok, that makes sense.

Thank you. :o

-Fredric

I saw an example function for some unknown algorithm in a book that was explaining big theta/o/omega notation. I understand how it all works, but this example is throwing me off:

f(n) =...

Heh, didn't realize that. :p Can you think of any other weird things like that in C?

-Fredric

Woah woah woah. What's so illegal with 'i=i++'? Wouldn't it just try to increment i, and then set i equal to the original value of i, making the ++ do effectively nothing? That's what it does when...

Here we go. I decided to do it without using any of those dirty bitwise operators. It was fun. :o No, I don't actually code like this.

#include <iostream>
#include <string>

using...