[LFQ-8] In Computer Science, is xor the solution to every problem?

Board 8 > In Computer Science, is xor the solution to every problem?

Topic List	Page List: 1
ShockKirby80 12/20/11 2:53:00 PM #1:	Yes xor no? -- I have 5000 Karma! I'm a ? Block! Now it's statistically proven that I have a 99.9% chance of having more Karma than you! <cite>ShockKirby80 posted [p:582216] in In Compute... [t:61414210]...</cite> <quote> Yes xor no? -- I have 5000 Karma! I'm a ? Block!Now it's statistically proven that I have a 99.9% chance of having more Karma than you! </quote> ... Copied to Clipboard!
_Regaro_ 12/20/11 2:54:00 PM #2:	If only -- http://img.imgcake.com/RegaroUlquiorrapngse.png <cite>_Regaro_ posted [p:582217] in In Compute... [t:61414210]...</cite> <quote> If only -- http://img.imgcake.com/RegaroUlquiorrapngse.png </quote> ... Copied to Clipboard!
SpeedYoshi 12/20/11 2:57:00 PM #3:	if you want it to be! -- Don't worry guys, I have all the clubs <cite>SpeedYoshi posted [p:582218] in In Compute... [t:61414210]...</cite> <quote> if you want it to be! -- Don't worry guys, I have all the clubs </quote> ... Copied to Clipboard!
paperwarior 12/20/11 2:59:00 PM #4:	If only Were you going for an iff joke there? -- http://img.imgcake.com/paperpngvu.png <cite>paperwarior posted [p:582219] in In Compute... [t:61414210]...</cite> <quote> If onlyWere you going for an iff joke there? -- http://img.imgcake.com/paperpngvu.png </quote> ... Copied to Clipboard!
_Regaro_ 12/20/11 3:00:00 PM #5:	From: paperwarior \| #004 If only Were you going for an iff joke there? if(only) print "xor is the solution to every problem" <_< -- http://img.imgcake.com/RegaroUlquiorrapngse.png <cite>_Regaro_ posted [p:582220] in In Compute... [t:61414210]...</cite> <quote> From: paperwarior \| #004If onlyWere you going for an iff joke there?if(only)print "xor is the solution to every problem"<_< -- http://img.imgcake.com/RegaroUlquiorrapngse.png </quote> ... Copied to Clipboard!
Ness26 12/20/11 3:00:00 PM #6:	I'm not sure about that, but I know the solution to every CS interview question is a hash map. -- No amount of planning will ever replace dumb luck. <cite>Ness26 posted [p:582221] in In Compute... [t:61414210]...</cite> <quote> I'm not sure about that, but I know the solution to every CS interview question is a hash map. -- No amount of planning will ever replace dumb luck. </quote> ... Copied to Clipboard!
foolm0ron 12/20/11 3:04:00 PM #7:	From: Ness26 \| #006 I'm not sure about that, but I know the solution to every CS interview question is a hash map. That's not true, what about "how do you initialize an array in constant time?" -- _foolmo_ mobile computer <cite>foolm0ron posted [p:582222] in In Compute... [t:61414210]...</cite> <quote> From: Ness26 \| #006I'm not sure about that, but I know the solution to every CS interview question is a hash map.That's not true, what about "how do you initialize an array in constant time?" -- _foolmo_mobile computer </quote> ... Copied to Clipboard!
_Regaro_ 12/20/11 3:06:00 PM #8:	From: foolm0ron \| #007 That's not true, what about "how do you initialize an array in constant time?" By using a linked hash map obviously -- http://img.imgcake.com/RegaroUlquiorrapngse.png <cite>_Regaro_ posted [p:582223] in In Compute... [t:61414210]...</cite> <quote> From: foolm0ron \| #007That's not true, what about "how do you initialize an array in constant time?"By using a linked hash map obviously -- http://img.imgcake.com/RegaroUlquiorrapngse.png </quote> ... Copied to Clipboard!
The Mana Sword 12/20/11 3:06:00 PM #9:	O(log(n)) -- FF fans don't hang around the internet on a monday morning they are out doing shopping or asleep hungover from parties. They got lives. -The_Djoker <cite>The Mana Sword posted [p:582224] in In Compute... [t:61414210]...</cite> <quote> O(log(n)) -- FF fans don't hang around the internet on a monday morning they are out doing shopping or asleep hungover from parties. They got lives. -The_Djoker </quote> ... Copied to Clipboard!
insanity domain 12/20/11 3:09:00 PM #10:	^This -- Visit GameSpot for more Jesus, including 24 screenshots. <cite>insanity domain posted [p:582225] in In Compute... [t:61414210]...</cite> <quote> ^This -- Visit GameSpot for more Jesus, including 24 screenshots. </quote> ... Copied to Clipboard!
foolm0ron 12/20/11 3:09:00 PM #11:	From: _Regaro_ \| #008 By using a linked hash map obviously Wait damn that's actually the solution... Okay how about......... uh... this is pretty hard -- _foolmo_ mobile computer <cite>foolm0ron posted [p:582226] in In Compute... [t:61414210]...</cite> <quote> From: _Regaro_ \| #008By using a linked hash map obviouslyWait damn that's actually the solution...Okay how about......... uh... this is pretty hard -- _foolmo_mobile computer </quote> ... Copied to Clipboard!
ShockKirby80 12/20/11 3:31:00 PM #12:	*The Mana Sword posted...* O(log(n)) O(2^n) -- I have 5000 Karma! I'm a ? Block! Now it's statistically proven that I have a 99.9% chance of having more Karma than you! <cite>ShockKirby80 posted [p:582227] in In Compute... [t:61414210]...</cite> <quote> The Mana Sword posted...O(log(n))O(2^n) -- I have 5000 Karma! I'm a ? Block!Now it's statistically proven that I have a 99.9% chance of having more Karma than you! </quote> ... Copied to Clipboard!
_Regaro_ 12/20/11 3:43:00 PM #13:	From: ShockKirby80 \| #012 *The Mana Sword posted...* O(log(n)) O(2^n) O(n^n) tbqh does such a function even exist <_< A loop of recursive calls would do it right -- http://img.imgcake.com/RegaroUlquiorrapngse.png <cite>_Regaro_ posted [p:582228] in In Compute... [t:61414210]...</cite> <quote> From: ShockKirby80 \| #012The Mana Sword posted...O(log(n))O(2^n)O(n^n) tbqhdoes such a function even exist <_< A loop of recursive calls would do it right -- http://img.imgcake.com/RegaroUlquiorrapngse.png </quote> ... Copied to Clipboard!
BlAcK TuRtLe 12/20/11 3:44:00 PM #14:	Technically, NAND is the solution to every problem, since you can make any circuit using NAND -- Game of the decade? More like Guru of the decade mirite? <cite>BlAcK TuRtLe posted [p:582229] in In Compute... [t:61414210]...</cite> <quote> Technically, NAND is the solution to every problem, since you can make any circuit using NAND -- Game of the decade? More like Guru of the decade mirite? </quote> ... Copied to Clipboard!
foolm0ron 12/20/11 3:49:00 PM #15:	From: _Regaro_ \| #013 O(n^n) tbqh does such a function even exist <_< A loop of recursive calls would do it right google says depth-first search on n branches, n levels deep -- _foolmo_ mobile computer <cite>foolm0ron posted [p:582230] in In Compute... [t:61414210]...</cite> <quote> From: _Regaro_ \| #013O(n^n) tbqhdoes such a function even exist <_< A loop of recursive calls would do it rightgoogle says depth-first search on n branches, n levels deep -- _foolmo_mobile computer </quote> ... Copied to Clipboard!
ShockKirby80 12/20/11 3:52:00 PM #16:	*_Regaro_ posted...* From: ShockKirby80 \| #012 The Mana Sword posted... O(log(n)) O(2^n) O(n^n) tbqh does such a function even exist <_< A loop of recursive calls would do it right On a CS test I had, someone put O(n!!) when the answer was O(n!). The teacher was amused. -- I have 5000 Karma! I'm a ? Block! Now it's statistically proven that I have a 99.9% chance of having more Karma than you! <cite>ShockKirby80 posted [p:582231] in In Compute... [t:61414210]...</cite> <quote> _Regaro_ posted...From: ShockKirby80 \| #012The Mana Sword posted...O(log(n))O(2^n)O(n^n) tbqhdoes such a function even exist <_< A loop of recursive calls would do it rightOn a CS test I had, someone put O(n!!) when the answer was O(n!). The teacher was amused. -- I have 5000 Karma! I'm a ? Block!Now it's statistically proven that I have a 99.9% chance of having more Karma than you! </quote> ... Copied to Clipboard!
Topic List	Page List: 1

Page List: 1

ShockKirby80
12/20/11 2:53:00 PM
#1:

Yes xor no?

--
I have 5000 Karma! I'm a ? Block!
Now it's statistically proven that I have a 99.9% chance of having more Karma than you!

<cite>ShockKirby80 posted [p:582216] in In Compute... [t:61414210]...</cite>
<quote>
        Yes xor no?
        
            --
            I have 5000 Karma! I'm a ? Block!Now it's statistically proven that I have a 99.9% chance of having more Karma than you!

        
    
    
    </quote>

... Copied to Clipboard!

_Regaro_
12/20/11 2:54:00 PM
#2:

If only

--
http://img.imgcake.com/RegaroUlquiorrapngse.png

<cite>_Regaro_ posted [p:582217] in In Compute... [t:61414210]...</cite>
<quote>
        If only
        
            --
            http://img.imgcake.com/RegaroUlquiorrapngse.png

        
    
    
    </quote>

... Copied to Clipboard!

SpeedYoshi
12/20/11 2:57:00 PM
#3:

if you want it to be!

--
Don't worry guys, I have all the clubs

<cite>SpeedYoshi posted [p:582218] in In Compute... [t:61414210]...</cite>
<quote>
        if you want it to be!
        
            --
            Don't worry guys, I have all the clubs

        
    
    
    </quote>

... Copied to Clipboard!

paperwarior
12/20/11 2:59:00 PM
#4:

If only

Were you going for an iff joke there?

--
http://img.imgcake.com/paperpngvu.png

<cite>paperwarior posted [p:582219] in In Compute... [t:61414210]...</cite>
<quote>
        If onlyWere you going for an iff joke there?
        
            --
            http://img.imgcake.com/paperpngvu.png

        
    
    
    </quote>

... Copied to Clipboard!

_Regaro_
12/20/11 3:00:00 PM
#5:

From: paperwarior | #004
If only

Were you going for an iff joke there?

if(only)
print "xor is the solution to every problem"

<_<

--
http://img.imgcake.com/RegaroUlquiorrapngse.png

<cite>_Regaro_ posted [p:582220] in In Compute... [t:61414210]...</cite>
<quote>
        From: paperwarior | #004If onlyWere you going for an iff joke there?if(only)print "xor is the solution to every problem"<_<
        
            --
            http://img.imgcake.com/RegaroUlquiorrapngse.png

        
    
    
    </quote>

... Copied to Clipboard!

Ness26
12/20/11 3:00:00 PM
#6:

I'm not sure about that, but I know the solution to every CS interview question is a hash map.

--
No amount of planning will ever replace dumb luck.

<cite>Ness26 posted [p:582221] in In Compute... [t:61414210]...</cite>
<quote>
        I'm not sure about that, but I know the solution to every CS interview question is a hash map.
        
            --
            No amount of planning will ever replace dumb luck.

        
    
    
    </quote>

... Copied to Clipboard!

foolm0ron
12/20/11 3:04:00 PM
#7:

From: Ness26 | #006
I'm not sure about that, but I know the solution to every CS interview question is a hash map.

That's not true, what about "how do you initialize an array in constant time?"

--
_foolmo_
mobile computer

<cite>foolm0ron posted [p:582222] in In Compute... [t:61414210]...</cite>
<quote>
        From: Ness26 | #006I'm not sure about that, but I know the solution to every CS interview question is a hash map.That's not true, what about "how do you initialize an array in constant time?"
        
            --
            _foolmo_mobile computer

        
    
    
    </quote>

... Copied to Clipboard!

_Regaro_
12/20/11 3:06:00 PM
#8:

From: foolm0ron | #007
That's not true, what about "how do you initialize an array in constant time?"

By using a linked hash map obviously

--
http://img.imgcake.com/RegaroUlquiorrapngse.png

<cite>_Regaro_ posted [p:582223] in In Compute... [t:61414210]...</cite>
<quote>
        From: foolm0ron | #007That's not true, what about "how do you initialize an array in constant time?"By using a linked hash map obviously
        
            --
            http://img.imgcake.com/RegaroUlquiorrapngse.png

        
    
    
    </quote>

... Copied to Clipboard!

The Mana Sword
12/20/11 3:06:00 PM
#9:

O(log(n))

--
FF fans don't hang around the internet on a monday morning they are out doing shopping or asleep hungover from parties. They got lives. -The_Djoker

<cite>The Mana Sword posted [p:582224] in In Compute... [t:61414210]...</cite>
<quote>
        O(log(n))
        
            --
            FF fans don't hang around the internet on a monday morning they are out doing shopping or asleep hungover from parties. They got lives. -The_Djoker

        
    
    
    </quote>

... Copied to Clipboard!

insanity domain
12/20/11 3:09:00 PM
#10:

^This

--
Visit GameSpot for more Jesus, including 24 screenshots.

<cite>insanity domain posted [p:582225] in In Compute... [t:61414210]...</cite>
<quote>
        ^This
        
            --
            Visit GameSpot for more Jesus, including 24 screenshots.

        
    
    
    </quote>

... Copied to Clipboard!

foolm0ron
12/20/11 3:09:00 PM
#11:

From: _Regaro_ | #008
By using a linked hash map obviously

Wait damn that's actually the solution...
Okay how about......... uh... this is pretty hard

--
_foolmo_
mobile computer

<cite>foolm0ron posted [p:582226] in In Compute... [t:61414210]...</cite>
<quote>
        From: _Regaro_ | #008By using a linked hash map obviouslyWait damn that's actually the solution...Okay how about......... uh... this is pretty hard
        
            --
            _foolmo_mobile computer

        
    
    
    </quote>

... Copied to Clipboard!

ShockKirby80
12/20/11 3:31:00 PM
#12:

The Mana Sword posted...
O(log(n))

O(2^n)

--
I have 5000 Karma! I'm a ? Block!
Now it's statistically proven that I have a 99.9% chance of having more Karma than you!

<cite>ShockKirby80 posted [p:582227] in In Compute... [t:61414210]...</cite>
<quote>
        The Mana Sword posted...O(log(n))O(2^n)
        
            --
            I have 5000 Karma! I'm a ? Block!Now it's statistically proven that I have a 99.9% chance of having more Karma than you!

        
    
    
    </quote>

... Copied to Clipboard!

_Regaro_
12/20/11 3:43:00 PM
#13:

From: ShockKirby80 | #012
The Mana Sword posted...
O(log(n))

O(2^n)

O(n^n) tbqh

does such a function even exist <_< A loop of recursive calls would do it right

--
http://img.imgcake.com/RegaroUlquiorrapngse.png

<cite>_Regaro_ posted [p:582228] in In Compute... [t:61414210]...</cite>
<quote>
        From: ShockKirby80 | #012The Mana Sword posted...O(log(n))O(2^n)O(n^n) tbqhdoes such a function even exist <_<  A loop of recursive calls would do it right
        
            --
            http://img.imgcake.com/RegaroUlquiorrapngse.png

        
    
    
    </quote>

... Copied to Clipboard!

BlAcK TuRtLe
12/20/11 3:44:00 PM
#14:

Technically, NAND is the solution to every problem, since you can make any circuit using NAND

--
Game of the decade? More like Guru of the decade mirite?

<cite>BlAcK TuRtLe posted [p:582229] in In Compute... [t:61414210]...</cite>
<quote>
        Technically, NAND is the solution to every problem, since you can make any circuit using NAND
        
            --
            Game of the decade? More like Guru of the decade mirite?

        
    
    
    </quote>

... Copied to Clipboard!

foolm0ron
12/20/11 3:49:00 PM
#15:

From: _Regaro_ | #013
O(n^n) tbqh

does such a function even exist <_< A loop of recursive calls would do it right

google says depth-first search on n branches, n levels deep

--
_foolmo_
mobile computer

<cite>foolm0ron posted [p:582230] in In Compute... [t:61414210]...</cite>
<quote>
        From: _Regaro_ | #013O(n^n) tbqhdoes such a function even exist <_<  A loop of recursive calls would do it rightgoogle says depth-first search on n branches, n levels deep
        
            --
            _foolmo_mobile computer

        
    
    
    </quote>

... Copied to Clipboard!

ShockKirby80
12/20/11 3:52:00 PM
#16:

_Regaro_ posted...
From: ShockKirby80 | #012
The Mana Sword posted...
O(log(n))

O(2^n)
O(n^n) tbqh

does such a function even exist <_< A loop of recursive calls would do it right

On a CS test I had, someone put O(n!!) when the answer was O(n!). The teacher was amused.

--
I have 5000 Karma! I'm a ? Block!
Now it's statistically proven that I have a 99.9% chance of having more Karma than you!

<cite>ShockKirby80 posted [p:582231] in In Compute... [t:61414210]...</cite>
<quote>
        _Regaro_ posted...From: ShockKirby80 | #012The Mana Sword posted...O(log(n))O(2^n)O(n^n) tbqhdoes such a function even exist <_<  A loop of recursive calls would do it rightOn a CS test I had, someone put O(n!!) when the answer was O(n!). The teacher was amused.
        
            --
            I have 5000 Karma! I'm a ? Block!Now it's statistically proven that I have a 99.9% chance of having more Karma than you!

        
    
    



</quote>

... Copied to Clipboard!

Topic List

Page List: 1

Board 8 > In Computer Science, is xor the solution to every problem? (+) Yeah! (+)

Board 8 > In Computer Science, is xor the solution to every problem?