Computer Science Stack Exchange

1

vote

1

answer

57

views

Why does $O(n \log n)$ seem so linear?

algorithm-analysis experimental-analysis

answered 23 hours ago Raphael♦ 58.3k

0

votes

1

answer

38

views

n-DNF boolean formula k satisfiability

complexity-theory algorithm-analysis np-complete satisfiability

modified yesterday Kyle Jones 5,857

2

votes

1

answer

176

views

A* 8-puzzle problem worst case memory usage

graphs algorithm-analysis searching space-analysis

modified yesterday Community♦ 1

1

vote

1

answer

322

views

Given max-flow determine if edge is in a min-cut

algorithms algorithm-analysis network-flow ford-fulkerson minimum-cuts

modified Apr 23 at 2:01 Community♦ 1

104

votes

13

answers

12k

views

How to fool the “try some test cases” heuristic: Algorithms that appear correct, but are actually incorrect

algorithms algorithm-analysis education correctness-proof didactics

modified Apr 22 at 8:50 jonaprieto 1,331

2

votes

2

answers

111

views

Constant factor of an array

algorithm-analysis data-structures amortized-analysis

modified Apr 21 at 12:15 Raphael♦ 58.3k

0

votes

0

answers

24

views

Question on preventing k from reducing too quickly during KMV intersection

algorithms algorithm-analysis probability-theory probabilistic-algorithms

asked Apr 20 at 2:01 user10714010 1

0

votes

2

answers

365

views

What if Indexes in Hoare's Quick Sort Algorithm Both Land on Values Less than Pivot?

algorithms algorithm-analysis sorting quicksort

modified Apr 19 at 23:02 Community♦ 1

3

votes

1

answer

487

views

Finding potential function for dynamic array

algorithm-analysis runtime-analysis amortized-analysis

modified Apr 19 at 18:03 Community♦ 1

1

vote

1

answer

20

views

Complexity of set partition generation while equivalence relation is given

algorithms complexity-theory algorithm-analysis sets

answered Apr 19 at 5:30 D.W.♦ 104k

7

votes

2

answers

2k

views

Time Complexity analysis for Map-Reduce model

algorithms algorithm-analysis runtime-analysis parallel-computing

modified Apr 17 at 20:03 Community♦ 1

3

votes

1

answer

67

views

Building maze to maximize shortest path, may be given waypoints and teleports

algorithms complexity-theory graphs algorithm-analysis

modified Apr 16 at 10:02 Community♦ 1

3

votes

1

answer

484

views

Complexity of many constant time steps with occasional logarithmic steps

algorithm-analysis runtime-analysis amortized-analysis

modified Apr 14 at 21:06 rtheunissen 139

0

votes

2

answers

64

views

Determining an appropriate number of buckets for a hash function

algorithm-analysis data-structures hash-tables

answered Apr 14 at 8:57 gnasher729 12.2k

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

Why does $O(n \log n)$ seem so linear?

n-DNF boolean formula k satisfiability

A* 8-puzzle problem worst case memory usage

Given max-flow determine if edge is in a min-cut

How to fool the “try some test cases” heuristic: Algorithms that appear correct, but are actually incorrect

Constant factor of an array

Question on preventing k from reducing too quickly during KMV intersection

What if Indexes in Hoare's Quick Sort Algorithm Both Land on Values Less than Pivot?

Finding potential function for dynamic array

Complexity of set partition generation while equivalence relation is given

Time Complexity analysis for Map-Reduce model

Building maze to maximize shortest path, may be given waypoints and teleports

Complexity of many constant time steps with occasional logarithmic steps

Determining an appropriate number of buckets for a hash function

Hot Network Questions