User Raphael

161 votes

Is there a system behind the magic of algorithm analysis?

answered Apr 9, 2014 at 12:59

94 votes

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

answered Aug 23, 2015 at 10:20

86 votes

Accepted

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

answered Mar 7, 2012 at 2:06

62 votes

Accepted

Dealing with intractability: NP-complete problems

answered Apr 24, 2012 at 6:58

61 votes

Accepted

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

answered Jan 18, 2017 at 7:06

58 votes

How to convert finite automata to regular expressions?

answered May 23, 2012 at 8:19

57 votes

Accepted

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

answered Apr 2, 2012 at 16:57

55 votes

Accepted

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

answered Mar 26, 2014 at 15:29

54 votes

Accepted

Sorting functions by asymptotic growth

answered Mar 27, 2012 at 17:12

52 votes

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

answered Feb 17, 2016 at 11:38

49 votes

How does a computer work?

answered Sep 2, 2012 at 15:03

46 votes

Accepted

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

answered Mar 13, 2012 at 14:36

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?

answered Jul 12, 2017 at 4:56

42 votes

Why do pushdown automata use a stack?

answered Oct 23, 2018 at 19:34

42 votes

Accepted

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

answered Jan 16, 2014 at 22:50

36 votes

Is there a system behind the magic of algorithm analysis?

answered Apr 9, 2014 at 13:01

36 votes

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

answered Mar 16, 2012 at 15:21

36 votes

Perplexed by Rice's theorem

answered Jul 18, 2012 at 10:26

34 votes

The time complexity of finding the diameter of a graph

answered Mar 10, 2012 at 14:12

34 votes

Accepted

Are there any non-finite automata?

answered Dec 6, 2017 at 14:06

34 votes

Accepted

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

answered Jul 14, 2016 at 11:24

32 votes

Accepted

Not all Red-Black trees are balanced?

answered Mar 14, 2012 at 15:00

32 votes

Accepted

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

answered Aug 3, 2015 at 15:07

31 votes

Why is quicksort better than other sorting algorithms in practice?

answered Mar 6, 2012 at 23:01

29 votes

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

answered Mar 14, 2012 at 9:04

29 votes

Solving or approximating recurrence relations for sequences of numbers

answered Aug 12, 2012 at 16:26

27 votes

How to show that L = L(G)?

answered Apr 14, 2013 at 19:02

27 votes

Accepted

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

answered Mar 20, 2012 at 13:02

27 votes

How to prove that a grammar is unambiguous?

answered Jun 11, 2012 at 11:38

26 votes

What is coinduction?

answered Mar 19, 2012 at 22:40

Stack Exchange Network

936 Answers

Is there a system behind the magic of algorithm analysis?

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

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

Dealing with intractability: NP-complete problems

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

How to convert finite automata to regular expressions?

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

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

Sorting functions by asymptotic growth

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

How does a computer work?

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

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?

Why do pushdown automata use a stack?

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

Is there a system behind the magic of algorithm analysis?

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

Perplexed by Rice's theorem

The time complexity of finding the diameter of a graph

Are there any non-finite automata?

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

Not all Red-Black trees are balanced?

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

Why is quicksort better than other sorting algorithms in practice?

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

Solving or approximating recurrence relations for sequences of numbers

How to show that L = L(G)?

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

How to prove that a grammar is unambiguous?

What is coinduction?