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

Ask Question

more tags

Active 2 Bountied Hot Week Month

2

votes

4

answers

827

views

exponentially different running times random-access machine (RAM) vs Turing machine

complexity-theory algorithm-analysis

answered 15 hours ago Mygod 101

1

vote

1

answer

13

views

Worst-case expected running time for Randomized Permutation Algorithm

algorithm-analysis asymptotics runtime-analysis probability-theory

answered 17 hours ago Matthew C 376

7

votes

2

answers

13k

views

Find largest and second largest elements of the array

algorithms graphs algorithm-analysis

modified 19 hours ago David Touchstone 1

1

vote

1

answer

19

views

Parity of number of divisors

algorithms algorithm-analysis proof-techniques

modified yesterday Yuval Filmus 220k

0

votes

1

answer

80

views

algorithm analysis - complex dependant nested loop

algorithm-analysis runtime-analysis loops

modified yesterday Community♦ 1

1

vote

1

answer

20

views

Can someone let me know if my understanding of amortized run time in a dynamic array list is correct?

algorithm-analysis time-complexity runtime-analysis amortized-analysis big-o-notation

answered Mar 28 at 7:59 gnasher729 17.9k

1

vote

2

answers

36

views

Why does MergeSort have O(n) space complexity if it splits the array log(n) times?

algorithms algorithm-analysis sorting mergesort

answered Mar 28 at 7:47 Steven 3,614

0

votes

2

answers

43

views

Time complexity for concatenating strings

algorithms algorithm-analysis big-o-notation

modified Mar 27 at 9:02 Community♦ 1

1

vote

1

answer

29

views

Why postfix is used more often than prefix expression?

algorithms algorithm-analysis mathematical-analysis stacks

answered Mar 25 at 21:39 axiac 121

1

vote

0

answers

25

views

How to find the asymptotic bit cost

algorithms algorithm-analysis asymptotics runtime-analysis

asked Mar 25 at 8:49 deltaskelta 111

2

votes

0

answers

34

views

How does the maximum number of guesses needed to win Mastermind (board game) change as the size of the board increases?

algorithms algorithm-analysis runtime-analysis

asked Mar 22 at 21:09 superfeen 43

4

votes

2

answers

909

views

Generating random words by grammar

algorithm-analysis formal-grammars probability-theory randomized-algorithms

answered Mar 19 at 12:39 phipsgabler 311

8

votes

1

answer

6k

views

How to use adversary arguments for selection and insertion sort?

algorithms algorithm-analysis proof-techniques lower-bounds

modified Mar 17 at 8:22 Massimo Cafaro 3,606

1

vote

1

answer

45

views

Space complexity of Travelling Salesman Problem

algorithms complexity-theory algorithm-analysis space-complexity traveling-salesman

answered Mar 16 at 17:47 Yuval Filmus 220k

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled