Stack Exchange

Evil

Poland

I am psychologist.

top accounts reputation activity bookmarks subscriptions
Top Questions
Top Answers
44
If everyone believes P ≠ NP, why is everyone sceptical of proof attempts for P ≠ NP?
cs.stackexchange.com

30
How long does the Collatz recursion run?
cs.stackexchange.com

28
Official FAQ on gender pronouns and Code of Conduct changes
meta.stackexchange.com

23
How can a language whose compiler is written in C ever be faster than C?
cs.stackexchange.com

19
Announcing the Stack Exchange Time Machine
meta.stackexchange.com

19
Why don't we use quick sort on a linked list?
cs.stackexchange.com

16
Is the halting problem decidable for pure programs on an ideal computer?
cs.stackexchange.com

13
Interpretation of for loop.
cs.stackexchange.com

12
What is meant by superlinear speedup? Is it possible to have superlinear speedup in practice?
cs.stackexchange.com

10
What is the difference between oblivious and non-oblivious merging, sorting etc
cs.stackexchange.com

10
Which other programming languages apart from Python and predecessor are out there using indentation to define code blocks?
cs.stackexchange.com

9
What is the fastest online sorting algorithm?
cs.stackexchange.com

8
Why does a color video compress better than a black and white video?
cs.stackexchange.com

8
Why does a MP3 encoder use a fast Fourier transform before applying the psychoacoustic model?
cs.stackexchange.com

8
Why is b-tree search O(log n)?
cs.stackexchange.com

8
What makes a language “optimized” for a specific task?
cs.stackexchange.com

7
Are “method” and “function” synonyms?
cs.stackexchange.com

7
Regular expressions and 'capturing parentheses' with 'backreferences'
cs.stackexchange.com

7
Why is the sequence “3,3,4,5,2” considered a bitonic sequence?
cs.stackexchange.com

6
Why is a (collision-less) hashtable lookup really O(1)?
cs.stackexchange.com

6
Complexity of sorting a 1-sorted array
cs.stackexchange.com

5
Automated optimization of 0-1 matrix vector multiplication
cs.stackexchange.com

5
Why not use large $k$ in a $k$-ary tree?
cs.stackexchange.com

5
Sum of divisors summatory function with Erathosthenes' sieve
cs.stackexchange.com

5
KD-Tree implementation with lat/lon coordinates
cs.stackexchange.com

5
Why do you need to fill the first element of array when implementing heap?
cs.stackexchange.com

5
I do not understand why finding the minimum of elements take O(n) time
cs.stackexchange.com

5
Compute equality comparison without comparison operators
cs.stackexchange.com

5
Comparison using only bitwise operators (and return -1 or 0)
cs.stackexchange.com

5
How to compare two circular sequences in linear time?
cs.stackexchange.com

1 2