Skip to main content
Share Your Experience: Take the 2024 Developer Survey
quicksort's user avatar
quicksort's user avatar
quicksort's user avatar
quicksort
  • Member for 7 years, 5 months
  • Last seen more than a month ago
21 votes

Why are some games np-complete?

15 votes

Algorithms with O(sqrt(N)) SPACE complexity?

12 votes

Does every data type just boil down to nodes with pointers?

12 votes
Accepted

Why is log(n) a space-constructible function?

10 votes

Is a Turing machine without the ability to write on blank cells less powerful than standard Turing?

9 votes
Accepted

How generate n equidistant points in a n-1 dimensional space

9 votes
Accepted

What do you call a DAG with a single root/source?

9 votes
Accepted

Why is it meaningless to say the runtime of an algorithm is at least in the order of n squared?

8 votes
Accepted

Number of times statement is executed in complex nested loop

7 votes

Time complexity of addition

7 votes
Accepted

Show that there are $(n-1)!/2$ distinct tours for a Euclidean traveling salesman problem on $n$ points?

7 votes

Sort an array of $n$ elements when only $\log n$ are not in place

7 votes

What is an extremely basic asymmetric cipher that I can present at the pub?

6 votes
Accepted

Efficent deterministic algorithm to sort n numbers with many duplicates ( distinct integers $O(\log n)$)

6 votes
Accepted

Runtime of sorting a partially-sorted array

6 votes

Why do floating point values have infinity?

5 votes

finite automata that accepts integers divided by 3?

5 votes
Accepted

Proving $a^{2+n}a^{n}$ is regular using the Pumping Lemma

5 votes

Is a computer equivalent to a Turing machine or linear bounded automata?

5 votes
Accepted

Check if there is only one simple path in graph between nodes x and y`

5 votes
Accepted

Nontrivial examples of sparse languages

5 votes

A several equivalent NP definitions

4 votes
Accepted

Algorithm to sort n numbers from 0 to $n^m$ in $\mathcal{O}(n)$? where m is a constant

4 votes
Accepted

Are finite-domain binary constraint satisfaction problems solvable in polynomial time?

4 votes

There are n numbers. Find the maximal set of pairwise NON coprime numbers

4 votes

Breadth-first forest

4 votes

What does being Turing complete mean?

4 votes
Accepted

Why does linear search have $\frac{n}{2}$ comparisons on average?

4 votes
Accepted

Breaking down CNF clauses

4 votes
Accepted

Ehrenfeucht-Fraïssé games, possible mistake in example