Raphael's user avatar
Raphael's user avatar
Raphael's user avatar
Raphael
Moderator
  • Member for 11 years, 11 months
  • Last seen this week
159 votes

Is there a system behind the magic of algorithm analysis?

94 votes

How can a language whose compiler is written in C ever be faster than C?

86 votes
Accepted

How does one know which notation of time complexity analysis to use?

61 votes
Accepted

Dealing with intractability: NP-complete problems

61 votes
Accepted

How is this sorting algorithm Θ(n³) and not Θ(n²), worst-case?

56 votes
Accepted

Are there minimum criteria for a programming language being Turing complete?

56 votes

How to convert finite automata to regular expressions?

55 votes
Accepted

How do O and Ω relate to worst and best case?

54 votes
Accepted

Sorting functions by asymptotic growth

52 votes

What are the reasons to learn different algorithms / data structures serving the same purpose?

50 votes

How does a computer work?

46 votes
Accepted

Show that { xy ∣ |x| = |y|, x ≠ y } is context-free

44 votes
Accepted

Is there an existing data structure that is of fixed size, and will push the oldest/last element out if a new element is inserted?

42 votes
Accepted

Why does Dijkstra's algorithm fail on a negative weighted graphs?

39 votes

Why do pushdown automata use a stack?

36 votes

How to prove that a language is not context-free?

36 votes

Perplexed by Rice's theorem

35 votes

Is there a system behind the magic of algorithm analysis?

34 votes
Accepted

Are there any non-finite automata?

34 votes
Accepted

Why are these (lossless) compression methods of many similar png images ineffective?

33 votes

The time complexity of finding the diameter of a graph

32 votes
Accepted

Not all Red-Black trees are balanced?

32 votes
Accepted

Least number of comparisons needed to sort (order) 5 elements

31 votes

Why is quicksort better than other sorting algorithms in practice?

29 votes

Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?

29 votes

Solving or approximating recurrence relations for sequences of numbers

27 votes
Accepted

Does there exist a priority queue with $O(1)$ extracts?

27 votes

How to prove that a grammar is unambiguous?

26 votes

How to show that L = L(G)?

25 votes
Accepted

Longest path in an undirected tree with only one traversal

1
2 3 4 5
32