Jump to content

Hello, Hi, Hey: I'm $$$ richh


Recommended Posts

  • Replies 493.9k
  • Created
  • Last Reply

Top Posters In This Topic

  • Starman

    60032

  • Kinumi

    38629

  • Lance Masayoshi

    26279

  • Soledai

    25884

Honestly, I think any researcher trying to reduce an O(log(n)) algorithm is wasting their time. O(log(n)) is already super efficient already, so it'd be more productive to research on something that can actually have a significant effect.

aren't there more and less efficient ways of doing an algorithm that are still technically O(log(n))?

like, some that would be faster in most cases or something?

Link to comment
Share on other sites

on the tourney

you're kicking ass

what characters are you using

that mishap with the scores and me getting put into losers because of it kinda bummed me out ;( so glad I'm almost to finals

I subbed in for PKL so I got his picks of Diddy and Sheik, and my 3rd is Pit because he was leftovers and I was one of the last people in the drafting order.

Link to comment
Share on other sites

that mishap with the scores and me getting put into losers because of it kinda bummed me out ;( so glad I'm almost to finals

I subbed in for PKL so I got his picks of Diddy and Sheik, and my 3rd is Pit because he was leftovers and I was one of the last people in the drafting order.

who is still in right now

Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

 Share

  • Recently Browsing   0 members

    • No registered users viewing this page.
×
×
  • Create New...