Computer Science Stack Exchange

0

votes

1

answer

16

views

What is a uniform algorithm?

algorithms algorithm-analysis

answered 12 hours ago Daniel Mera 1

3

votes

1

answer

13k

views

Time complexity of this solution to N-queens problem

algorithms algorithm-analysis asymptotics search-algorithms backtracking

modified Jun 13 at 11:02 Community♦ 1

30

votes

4

answers

39k

views

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

algorithm-analysis asymptotics landau-notation reference-question

modified Jun 12 at 12:30 Yuval Filmus 202k

2

votes

1

answer

985

views

Building heaps and heapsort using linked list

algorithms algorithm-analysis data-structures time-complexity heaps

answered Jun 12 at 8:00 user106409 1

1

vote

0

answers

28

views

How is the modular multiplication matrix unitary in Shor's Algorithm?

algorithms algorithm-analysis quantum-computing linear-algebra modular-arithmetic

asked Jun 11 at 4:34 Marlon_T 6

0

votes

1

answer

29

views

Finding the maximum disjoint weight in a weighted node graph

algorithms graphs algorithm-analysis weighted-graphs

answered Jun 7 at 13:33 smapers 66

1

vote

0

answers

30

views

Hypergraph sorting computational complexity

algorithms algorithm-analysis

modified Jun 7 at 10:03 Salwa 6

3

votes

2

answers

160

views

Invariant on “Find K Closest Elements” problem

algorithms algorithm-analysis binary-search loop-invariants

modified Jun 6 at 4:07 Community♦ 1

3

votes

1

answer

88

views

How to understand the recurrence relation and time-complexity of StoogeSort?

algorithms algorithm-analysis divide-and-conquer

modified Jun 5 at 20:50 Apass.Jack 17k

2

votes

0

answers

29

views

Analysis quickselect: Median of Medians with duplicates

algorithms algorithm-analysis

asked Jun 3 at 22:16 User1597553 11

5

votes

2

answers

581

views

Confusion with analysis of hashing with chaining

complexity-theory algorithm-analysis asymptotics hash-tables

answered Jun 3 at 13:57 Lykos 101

2

votes

1

answer

30

views

Conditions for maximum period of quadratic congruential method (PRNG)

algorithms algorithm-analysis modular-arithmetic

modified Jun 3 at 13:56 Apass.Jack 17k

1

vote

1

answer

32

views

What does it mean when saying “we want $\Lambda$ to be $\tilde{O}(1)$ as a function of $M$”?

complexity-theory algorithm-analysis error-estimation

modified May 29 at 5:03 Community♦ 1

1

vote

2

answers

686

views

In algorithm analysis what does it mean for bounds to be “tight”

algorithm-analysis terminology landau-notation

modified May 25 at 7:03 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

What is a uniform algorithm?

Time complexity of this solution to N-queens problem

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

Building heaps and heapsort using linked list

How is the modular multiplication matrix unitary in Shor's Algorithm?

Finding the maximum disjoint weight in a weighted node graph

Hypergraph sorting computational complexity

Invariant on “Find K Closest Elements” problem

How to understand the recurrence relation and time-complexity of StoogeSort?

Analysis quickselect: Median of Medians with duplicates

Confusion with analysis of hashing with chaining

Conditions for maximum period of quadratic congruential method (PRNG)

What does it mean when saying “we want $\Lambda$ to be $\tilde{O}(1)$ as a function of $M$”?

In algorithm analysis what does it mean for bounds to be “tight”

Hot Network Questions