Print

Please login or register.
1 Hour 1 Day 1 Week 1 Month Forever
Login with username, password and session length

[Gentlefish]

Have the top of the tree be Root? Then you go 0 or 1. Then 00, 01, 10, 11. Then so on and so forth.

[Putnam]

The problem is the compression.

[Xantalos]

[EXCITEMENT INTENSITFIES]

[Arcvasti]

[EXCITEMENT INTENSITFIES]

_{What are we even getting excited about.}

[Gentlefish]

The problem is the compression.

What about just L, R; LL, LR, RL, RR?

[Sirus]

[EXCITEMENT INTENSITFIES]

_{What are we even getting excited about.}

Some sort of Bionicle tabletop game, if I remember correctly.

[Arcvasti]

[EXCITEMENT INTENSITFIES]

_{What are we even getting excited about.}

Some sort of Bionicle tabletop game, if I remember correctly.

Oh, I am definitely excited about that. I just didn't connect that with the Bionicle post. Too much buzzing between threads when I really should be sleeping.

[Iceblaster]

I love the line battle multiplayer concept(Which the DLC was free though) and combine that with this guy's voice and style of commentary, I just can't help but be happy watching it.

Le Video.

[hops]

Earlier in the day, the guy who I have in my physics practical test group in the near future who I expected to despise me and be a total jerk to me approached me and was being pretty friendly.

Paranoia, Y U make me look stupid.

[tuypo1]

Earlier in the day, the guy who I have in my physics practical test group in the near future who I expected to despise me and be a total jerk to me approached me and was being pretty friendly.

Paranoia, Y U make me look stupid.

Hooray for new friends

[KingofstarrySkies]

catgroove

get out of my head pls

CATGROOVE

STAAAAAAAAAAAAHP

[Blargityblarg]

See, that's cumbersome. Also, not even necessarily true; someone can live in simply right-left, for example.

that's not how binary search trees work; only leaf nodes contain data

I suppose if you had an unbalanced tree you could have people with shorter addresses - could even create a class system, with consecutively fewer and fewer (halved each level) people for each address

[hops]

Earlier in the day, the guy who I have in my physics practical test group in the near future who I expected to despise me and be a total jerk to me approached me and was being pretty friendly.

Paranoia, Y U make me look stupid.

Hooray for new friends

We're already friends though, I just thought we weren't friends anymore, but I guess I was worrying too much.

[tuypo1]

Earlier in the day, the guy who I have in my physics practical test group in the near future who I expected to despise me and be a total jerk to me approached me and was being pretty friendly.

Paranoia, Y U make me look stupid.

Hooray for new friends

We're already friends though, I just thought we weren't friends anymore, but I guess I was worrying too much.

well then hooray for not losing friends

[Putnam]

See, that's cumbersome. Also, not even necessarily true; someone can live in simply right-left, for example.

that's not how binary search trees work; only leaf nodes contain data

I suppose if you had an unbalanced tree you could have people with shorter addresses - could even create a class system, with consecutively fewer and fewer (halved each level) people for each address

Doesn't necessarily have to be a binary search tree, only modeled after one. After all, the nodes have an awfully large overhead that it would simply be a shame to allow to go to waste, hehe.