i can translate the english Onlink to german language

to point 4 Yeah own chip making
^^ but i dont think this will be the suprise

There is a form of programming for non-coders (GUI Based) in the Warcraft III: The Frozen Throne World Editor. The coding is called "Triggers," and there is a large list of preset codes with pieces that can be modified, such as "If [a] = , then do action [c]" where a and b are variables and c can be a variety of actions such as "Set unit [x] health to [y] percent of total health. And then there's a command "Custom Script" which allows people to code more into the triggers. Done for coding software in onlink, and we could end up with some seriously awesome programs.

Y'know, I don't actually get how algorithms equate to big-O equations. I mean, I get that O(n) is hellass slower than O(log n), but I don't get how one set of code can be said to be O(n), or a different set to be O(log n). (My teacher explained, briefly, as she was in the midst of teaching Programming 2 [I'm in 3... one of four who are, sadly], what O(n) meant, so I sorta get that.)

-- Griffinhart

It's really quite easy.

n refers to the number of elements in your data structure.
O is the worst case scenario for how many keys you'll need to go through in order to get the one you want (round up to the nearest integer)

Also note that log is not log. It is log-base-2, since it is a binary tree. Therefore,
[O(log2 n) | n = 2000] ≈ 10.9657843 (round up to 11).

Therefore, it is said that with 2000 elements in the red black tree, the most steps it's going to ever make in the tree before it finds the desired node is 11.

Isn't that easy? :3

You know what?

That was easy. Thanks, Miah!

/me stores this away for AP exam time

Only, I still don't get how to determine the actual big-O of a given segment of code.

-- Griffinhart

The easiest way is to count the # of loops.
Each for loop multiplies the O notation by n (provided it goes to n of course).

I still don't know how to determine the O notation for things that end up being log. I know that binary searches are log, and certain sorts are nlog, but I don't really know how to calculate those.

I realize this isn't a greetings topic, and that I'm new to the forum, but to elaborate...is there at least a month to aim the 0.2.0 release for?

I am NOT asking for a release day.


...just a month.

If there was, it would have been said.

Imo, I'd shoot for the calculated release date. Because I know Miah is probably very busy, or burnt out from the daily grind, or even just in need of positive encouragement (which is never a bad thing). : )

And what about a release year? Hope this one

The release year is between 2009 and <Insert End-Of-World Year>

Guys, how's it goin? I heard Miah had a problem, and after solving it there is should be downhill riding.

maybe he doesn't solved it yet

Hey its been a while since we have had any info on the project, could we possibly get an update? That way the Analysts among us can work up another "prospective" release date

I'll better call it another "too-soon" release date.
It's only a joke. C'mon Miah, keep up the good work. You know that we give you all the moral help we can.