Return
Styles:
Pseud0ch
,
Terminal
,
Valhalla
,
NES
,
Geocities
,
Blue Moon
.
Pages:
1-
Complexity Theory
1
Name:
Anonymous
2018-11-16 17:30
redpill me on complexity theory
big O-face, NP flaccid and NP hard, all that shit
2
Name:
Anonymous
2018-11-16 17:39
virgin O(log n)
chad O(2^n)
3
Name:
Anonymous
2018-11-16 17:48
>>2
alpha (n^n)
4
Name:
Anonymous
2018-11-16 18:51
\(O(\log n)\)
my anus
5
Name:
Anonymous
2018-11-16 19:48
>>4
O(log n) is very fast, you're saying you don't have endurance?
or that you don't have high complexity, meaning you're easy?
6
Name:
Anonymous
2018-11-16 20:00
>>5
Could be just very sensitive and easily satisfied.
Or it could be space complexity. Not everyone has a roastie-sized O(n^3) coal furnace.
7
Name:
Anonymous
2018-11-17 6:10
\(O(n log_2 n)\)
might as well be
\(O(n)\)
because you will never have
\(log_2 n\)
be larger than
\(80\)
.
Don't change these.
Name:
Email:
Entire Thread
Thread List