The Stack Overflow podcast is back! Listen to an interview with our new CEO.

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

1

vote

1

answer

12

views

Recursion from a special case of quick sort

algorithm-analysis runtime-analysis sorting quicksort amortized-analysis

answered 4 hours ago OmG 1,990

1

vote

1

answer

26

views

Multiple choice knapsack dynamic problem

algorithms algorithm-analysis dynamic-programming knapsack-problems

answered 9 hours ago Christopher Boo 348

0

votes

0

answers

18

views

time complexity of 2 sum problem using binary search

algorithms algorithm-analysis time-complexity runtime-analysis binary-search

asked yesterday tedd 1

1

vote

0

answers

15

views

Traceless In-place Selection

algorithms algorithm-analysis selection-problem

asked 2 days ago Srishti Ghorpade 6

8

votes

1

answer

7k

views

What does the 2 in a 2-approximation algorithm mean?

algorithms algorithm-analysis np approximation polynomial-time

modified Oct 17 at 0:09 user110811 1

1

vote

2

answers

141

views

How can I make my algorithm more efficient or Is there a better way to solve the problem

algorithms algorithm-analysis data-structures discrete-mathematics

modified Oct 13 at 20:44 greybeard 484

0

votes

0

answers

24

views

proving long asymptotic bounds

algorithms algorithm-analysis asymptotics runtime-analysis

asked Oct 12 at 4:17 Xi N 8

1

vote

0

answers

40

views

Data structure for storing strings

algorithms algorithm-analysis data-structures trees

modified Oct 11 at 20:56 kevin 6

3

votes

1

answer

45

views

DP for Weighted Interval Scheduling: why is sorting by finish time necessary?

algorithm-analysis dynamic-programming scheduling

modified Oct 10 at 3:38 shanshan li 20

0

votes

2

answers

34

views

An underestimated tradeoff between Memory and the Effectivity of Computation?

algorithms algorithm-analysis memoization

answered Oct 9 at 13:47 SomeGuy 3

0

votes

1

answer

69

views

how to prove correctness of this BFS algorithm?

graphs algorithm-analysis graph-traversal correctness-proof

modified Oct 8 at 4:03 Community♦ 1

0

votes

0

answers

19

views

A sandwich Algorithm / Data Structure

algorithm-analysis

asked Oct 5 at 5:22 Vk1 110

3

votes

2

answers

184

views

Invariant on “Find K Closest Elements” problem

algorithms algorithm-analysis binary-search loop-invariants

modified Oct 4 at 5:00 Community♦ 1

0

votes

1

answer

37

views

Derive a while loop (which seemingly have some logarithmic traits) runs in $\Theta(n)$

algorithm-analysis asymptotics runtime-analysis big-o-notation

answered Oct 3 at 8:31 David Richerby 75.5k

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled