tanmoy
  • Member for 7 years, 11 months
  • Last seen more than a month ago
12 answers
367 votes
335k views
245 bookmarks
Why is quicksort better than other sorting algorithms in practice?
7 answers
310 votes
146k views
319 bookmarks
What is the definition of P, NP, NP-complete and NP-hard?
3 answers
187 votes
23k views
201 bookmarks
Is there a system behind the magic of algorithm analysis?
12 answers
145 votes
42k views
86 bookmarks
Why are there so many programming languages?
14 answers
130 votes
20k views
40 bookmarks
Why can I look at a graph and immediately find the closest point to another point, but it takes me O(n) time through programming?
8 answers
61 votes
5k views
26 bookmarks
Algorithmic intuition for logarithmic complexity
3 answers
49 votes
75k views
17 bookmarks
Why does Dijkstra's algorithm fail on a negative weighted graphs?
2 answers
47 votes
8k views
33 bookmarks
What is the difference between an algorithm, a language and a problem?
4 answers
41 votes
30k views
17 bookmarks
Are there NP problems, not in P and not NP Complete?
7 answers
41 votes
4k views
23 bookmarks
What is the definition of Computer Science, and what is the Science within Computer Science?
6 answers
40 votes
6k views
34 bookmarks
How does a computer work?
6 answers
30 votes
40k views
19 bookmarks
Why Do Computers Use the Binary Number System (0,1)?
10 answers
26 votes
11k views
20 bookmarks
Why is non-determinism a useful concept?
10 answers
26 votes
11k views
20 bookmarks
Why is non-determinism a useful concept?
5 answers
25 votes
16k views
12 bookmarks
What is meant by "solvable by non deterministic algorithm in polynomial time"
3 answers
19 votes
3k views
5 bookmarks
Why use comparisons instead of runtime for comparing two algorithms?
3 answers
13 votes
1k views
4 bookmarks
Why use languages in Complexity theory
2 answers
10 votes
12k views
5 bookmarks
Branch and Bound explanation
4 answers
10 votes
394 views
2 bookmarks
Example of an algorithm where a low-order term dominates the runtime for any practical input?
2 answers
7 votes
431 views
1 bookmarks
Finite representations and programming languages Countably inifite
1 answers
7 votes
567 views
5 bookmarks
How do we know any problem is in NP-complete if we don't know all problems in NP?
3 answers
6 votes
10k views
1 bookmarks
I need clarification about DFA's and DFA acceptable languages
2 answers
5 votes
1k views
6 bookmarks
How to get 2-state PDA for CFG?
3 answers
4 votes
3k views
2 bookmarks
Can somebody explain Horner's method of evaluating polynomials and how does it reduce the time complexity to 2n operations?
0 answers
1 votes
97 views
1 bookmarks
Solving complicated recurrence
4 answers
0 votes
2k views
1 bookmarks
Why is constant always dropped from big O analysis?