User ً ً

167

votes

12

answers

55k

views

Why, really, is the Halting Problem so important?

computability halting-problem

Dec 1 at 21:29 Brent 2,329

8

votes

2

answers

19k

views

Changing from Kernel mode to User mode (and vice versa)

Nov 5 at 0:42 Narrateur du chaos 187

19

votes

7

answers

53k

views

Why can't DFS be used to find shortest paths in unweighted graphs?

algorithms graphs shortest-path

Oct 30 at 9:20 Apurv 1

96

votes

3

answers

28k

views

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

algorithms terminology asymptotics landau-notation reference-question

Sep 24 at 10:04 oklm 1

287

votes

7

answers

133k

views

What is the definition of P, NP, NP-complete and NP-hard?

complexity-theory terminology complexity-classes p-vs-np reference-question

Apr 19 at 23:23 Community♦ 1

11

votes

2

answers

16k

views

Master theorem not applicable?

proof-techniques asymptotics recurrence-relation master-theorem

Apr 17 at 21:55 Community♦ 1

98

votes

2

answers

68k

views

Quicksort Partitioning: Hoare vs. Lomuto

algorithms sorting quicksort

Mar 24 at 12:51 nonopolarity 405

5

votes

1

answer

11k

views

Difference between page table and inverted page table

operating-systems

Mar 23 at 14:17 alexlomba87 103

39

votes

4

answers

44k

views

Algorithm that finds the number of simple paths from $s$ to $t$ in $G$

algorithms graphs

Mar 23 at 13:15 Téo Bouvard 1

49

votes

3

answers

24k

views

Contrasting Peterson’s and Dekker’s algorithms

concurrency synchronization mutual-exclusion

Jan 23 '20 at 23:00 Wandering Logic 16.4k

101

votes

5

answers

16k

views

How not to solve P=NP?

complexity-theory reference-request history p-vs-np reference-question

Sep 20 '19 at 22:26 Community♦ 1

5

votes

3

answers

7k

views

Look Ahead buffer vs Translation Look aside buffer

operating-systems paging virtual-memory

Feb 23 '19 at 9:18 Shailendra 101

65

votes

4

answers

63k

views

What is tail recursion?

algorithms reference-request recursion

Dec 14 '17 at 12:18 codesparkle 105

40

votes

6

answers

5k

views

How does a computer work?

computer-architecture education reference-question

Oct 4 '17 at 10:20 Wellensure - Sanjay Sathe 1

28

votes

4

answers

33k

views

The time complexity of finding the diameter of a graph

algorithms time-complexity graphs

Jul 8 '17 at 18:34 Community♦ 1

13

votes

2

answers

6k

views

Number of possible search paths when searching in BST

data-structures combinatorics binary-trees search-trees graph-traversal

Jun 16 '17 at 15:58 ً ً 445

130

votes

4

answers

178k

views

How to convert finite automata to regular expressions?

algorithms formal-languages finite-automata regular-expressions reference-question

Mar 30 '17 at 6:14 Community♦ 1

38

votes

5

answers

112k

views

How to come up with the runtime of algorithms? [duplicate]

algorithms algorithm-analysis runtime-analysis reference-question

Mar 21 '17 at 19:40 Community♦ 1

139

votes

12

answers

40k

views

Why are there so many programming languages?

programming-languages

Aug 25 '16 at 17:28 c650 103

10

votes

1

answer

744

views

Complexity of a naive algorithm for finding the longest Fibonacci substring

algorithms algorithm-analysis runtime-analysis strings substrings

Mar 24 '16 at 23:41 Yuval Filmus 241k

1

vote

2

answers

3k

views

Switching between user-level and kernel-level threads

operating-systems process-scheduling threads os-kernel

Mar 8 '16 at 21:55 vonbrand 12.5k

13

votes

2

answers

8k

views

How to prove P$\neq$NP?

complexity-theory p-vs-np

Dec 23 '15 at 21:58 Community♦ 1

49

votes

10

answers

6k

views

If the speed of electrical charge hasn't changed, how have computers become faster?

computer-architecture

Dec 15 '15 at 22:00 Jeff 1

35

votes

4

answers

4k

views

What is dynamic programming about?

algorithms dynamic-programming algorithm-design

Nov 15 '15 at 10:56 Community♦ 1

187

votes

10

answers

52k

views

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

programming-languages compilers efficiency

Sep 11 '15 at 15:52 Community♦ 1

0

votes

1

answer

2k

views

Algorithm for constructing BST from post-order traversal

algorithms algorithm-analysis runtime-analysis correctness-proof

Sep 8 '15 at 7:15 Raphael♦ 69.1k

32

votes

3

answers

62k

views

Why is selection sort faster than bubble sort?

algorithms runtime-analysis efficiency sorting

Mar 30 '15 at 1:01 simonmysun 171

-1

votes

1

answer

123

views

How the below program is taking O(n!) time? [closed]

algorithm-analysis runtime-analysis

Aug 13 '14 at 15:33 ZeroUltimax 762

38

votes

1

answer

9k

views

Do you get DFS if you change the queue to a stack in a BFS implementation?

algorithms graphs

Jun 30 '14 at 23:13 Jimmy Tsai 1

14

votes

1

answer

2k

views

Counting inversion pairs

algorithms reference-request arrays

Sep 4 '12 at 17:41 Raphael♦ 69.1k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next badge

32 Bookmarks

Why, really, is the Halting Problem so important?

Changing from Kernel mode to User mode (and vice versa)

Why can't DFS be used to find shortest paths in unweighted graphs?

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

What is the definition of P, NP, NP-complete and NP-hard?

Master theorem not applicable?

Quicksort Partitioning: Hoare vs. Lomuto

Difference between page table and inverted page table

Algorithm that finds the number of simple paths from $s$ to $t$ in $G$

Contrasting Peterson’s and Dekker’s algorithms

How not to solve P=NP?

Look Ahead buffer vs Translation Look aside buffer

What is tail recursion?

How does a computer work?

The time complexity of finding the diameter of a graph

Number of possible search paths when searching in BST

How to convert finite automata to regular expressions?

How to come up with the runtime of algorithms? [duplicate]

Why are there so many programming languages?

Complexity of a naive algorithm for finding the longest Fibonacci substring

Switching between user-level and kernel-level threads

How to prove P$\neq$NP?

If the speed of electrical charge hasn't changed, how have computers become faster?

What is dynamic programming about?

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

Algorithm for constructing BST from post-order traversal

Why is selection sort faster than bubble sort?

How the below program is taking O(n!) time? [closed]

Do you get DFS if you change the queue to a stack in a BFS implementation?

Counting inversion pairs