Deep though in Java class...

[lapis_knight]

How many frames would a framerate rate if a framerate could rate frames?

Also, did you know that the execution time of a binary search algorithm is actually *maximized* if the information it's searching through is sorted? Crazy!

Comments

[zrg5000]

The answer to your questions are 274 and yes I did know that.

[coweringmeepo]

I don't know what that means, but it makes a lot of sense to me, in my ignorance. It's like going through a binder full of Magic cards. If you've got them sorted in some way (by color, set, and name, for example) it's a lot easier to find something than if it's just a bunch of random cards in a binder (I've done it both ways). That's my two cents, although I'm not sure what it's actually worth with the exchange rate and all. *laugh*

I think the answer to the framerate question is "James Madison." ^_^

[lapis_knight]

Well, actually, what I was saying is if you have them organized in this structure called a binary search tree, the search will take the *longest* when the cards are in, say, alphabetical order within the tree.

So presorting the information will only make the process less efficient. There's a reason for this, but it requires a diagram.

[coweringmeepo]

Oh! I see now. You said "execution time". The first time I read it I must've missed "time".

"So presorting the information will only make the process less efficient. There's a reason for this, but it requires a diagram."

James Madison requires a diagram? *laugh*