Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community

Anybody can ask a question

Anybody can answer

The best answers are voted up and rise to the top

Explore our Questions

more tags

Active 2 Bountied Hot Week Month

1

vote

1

answer

14

views

Weird implementation of quicksort

algorithms algorithm-analysis sorting

modified 7 hours ago dkaeae 4,255

0

votes

2

answers

398

views

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

algorithms algorithm-analysis sorting quicksort

modified 2 days ago Community♦ 1

3

votes

1

answer

542

views

Finding potential function for dynamic array

algorithm-analysis runtime-analysis amortized-analysis

modified 2 days ago Community♦ 1

1

vote

2

answers

34

views

Time complexity of finding predecessor for a dictionary implemented as a sorted array

algorithms algorithm-analysis time-complexity

modified Aug 17 at 15:46 rici 5,268

7

votes

2

answers

2k

views

Time Complexity analysis for Map-Reduce model

algorithms algorithm-analysis runtime-analysis parallel-computing

modified Aug 15 at 21:01 Community♦ 1

1

vote

2

answers

36

views

Big-O Notation and Calculus?

algorithms algorithm-analysis complexity-classes program-optimization big-o-notation

answered Aug 15 at 16:21 Juho 16.6k

3

votes

1

answer

84

views

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

algorithms complexity-theory graphs algorithm-analysis

modified Aug 14 at 11:02 Community♦ 1

1

vote

1

answer

23

views

What is the time complexity of a binary multiplication using Karatsuba Algorithm?

algorithms algorithm-analysis time-complexity arithmetic

modified Aug 13 at 20:53 Jakube 1,011

0

votes

0

answers

32

views

Proof of the average case of the Heap Sort algorithm

algorithm-analysis time-complexity runtime-analysis correctness-proof average-case

asked Aug 12 at 5:34 YFP 4

9

votes

1

answer

688

views

Why say that breadth-first search runs in time $O(|V|+|E|)$?

algorithm-analysis search-algorithms

modified Aug 9 at 18:20 salcc 27

0

votes

1

answer

44

views

Question about how can i determine if counting sort is the right option over other sorting algorithms

complexity-theory algorithm-analysis sorting

modified Aug 9 at 9:02 Community♦ 1

0

votes

1

answer

30

views

UCT (Upper Confidence bounds applied to Trees)

algorithms algorithm-analysis search-trees monte-carlo

modified Aug 8 at 17:57 GBat 500

1

vote

1

answer

113

views

Runtime analysis of prime-set computation

algorithm-analysis runtime-analysis

modified Aug 7 at 22:01 Community♦ 1

0

votes

1

answer

370

views

Predecessor-subgraph property

graphs algorithm-analysis

modified Aug 7 at 15:03 Community♦ 1

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled