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 Hot Week Month

0

votes

3

answers

233

views

How many times in this pseudo-code is the function F called?

algorithm-analysis recursion

modified 3 hours ago Community♦ 1

2

votes

1

answer

61

views

trouble solving the recurrence 4T(n/2) + n

algorithm-analysis runtime-analysis recurrence-relation recursion

answered yesterday Rohit Singh 11

1

vote

2

answers

113

views

Proving that the recurrence $T(n) = 2T\left(\frac{n}{2}\right) + 1$ with $T(2) = 1$ is asymptotically $O(n)$

algorithm-analysis recurrence-relation discrete-mathematics

answered 2 days ago Rohit Singh 11

0

votes

1

answer

30

views

Inversions of Insertion Sort and Bubble Sort

algorithms algorithm-analysis

modified Sep 15 at 22:21 Steven 18.6k

0

votes

2

answers

39

views

inversions in array

algorithms algorithm-analysis

answered Sep 15 at 9:43 zkutch 2,141

1

vote

1

answer

40

views

Do the following two CFGs describe the same language

algorithms algorithm-analysis

modified Sep 15 at 9:04 Community♦ 1

0

votes

1

answer

22

views

sort is equal to inversions logic

algorithms algorithm-analysis big-o-notation

answered Sep 15 at 0:12 nir shahar 8,743

0

votes

1

answer

15

views

simplified into asymptotic notation

algorithms algorithm-analysis big-o-notation

answered Sep 14 at 6:15 zkutch 2,141

0

votes

2

answers

213

views

algorithm analysis - complex dependant nested loop

algorithm-analysis runtime-analysis loops

modified Sep 12 at 7:04 Community♦ 1

2

votes

1

answer

156

views

Hypothetical Situation for sorting in $O(n)$ using median finding machine that works in $O(\sqrt{n})$

algorithm-analysis runtime-analysis sorting ordering

modified Sep 12 at 1:03 Community♦ 1

0

votes

1

answer

26

views

Polynomial and fully polynomial time approximation scheme

algorithm-analysis runtime-analysis approximation polynomial-time

modified Sep 10 at 7:00 Community♦ 1

0

votes

2

answers

1k

views

how to prove correctness of this BFS algorithm?

graphs algorithm-analysis graph-traversal correctness-proof

modified Sep 9 at 19:04 Community♦ 1

1

vote

1

answer

200

views

CLRS Question 8-6 Lower bound on merging sorted lists

algorithm-analysis lower-bounds

modified Sep 7 at 13:07 Community♦ 1

2

votes

1

answer

71

views

Max sum cyclic path of fixed length in matrix

algorithms algorithm-analysis dynamic-programming

modified Sep 7 at 2:06 Community♦ 1

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled